FA-70760 / GIS polygon topology / Member archive

Node degree classification in an arc-node topology: numeric node ordering · case 05

Node reports come out in input order.

Member previewVariant 5 · 3 implementations · 8 checks per implementation

Case contract

Input [nodes, arcs] with integer node ids and arcs [arc_id, from, to]. Degree counts arc ends, so a loop adds 2 to its node. Label degree 0 "isolated", 1 "dangle", 2 "pseudo", 3 or more "node". Return [[node, degree, label], ...] in ascending numeric node order, including isolated nodes.

Why this case matters

Topology QA flags dangles (undershoots) and pseudo-nodes (unnecessary splits); miscounting loops turns valid island rings into errors.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
regression #5	`[[2, 2, "pseudo"], [10, 2, "pseudo"], [11, 2, "pseudo"], [3, 2, "pseudo"]]`	`[[2, 2, "pseudo"], [3, 2, "pseudo"], [10, 2, "pseudo"], [11, 2, "pseudo"]]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.