kruskal

Generic Description

Minimum spanning tree construction by greedy edge addition.

Simple example:

CALL nexyron.kruskal()

Tree and flow procedures optimize connectivity or movement through weighted graphs. They are useful for network design, allocation, dependency coverage, and capacity analysis.

Consumer-Level Explanation

Use kruskal when minimum spanning tree construction by greedy edge addition is the graph-analysis or operational question you actually need to answer. Keep the call explicit because its YIELD columns, row grain, and required runtime state determine how the rest of the Cypher pipeline can safely compose it. These algorithms make stronger assumptions about weights, terminals, prizes, and capacities than simple traversal, so parameter meaning must be explicit.

Conceptual Explanation

kruskal should be read as one named procedure contract in the broader Nexyron Cypher surface. The procedure call is not only a syntax hook: it defines what runtime state, projection, registry entry, or graph algorithm is being asked to operate, and it determines which output columns downstream YIELD, WITH, and RETURN stages can safely use.

More Detailed Explanation

Kruskal differs from Prim mostly in growth strategy, not in the final optimization target

In practical queries, start by deciding the row grain you want after the call: one row per node, one row per path, one row per registry object, one row per artifact, or one row per summary. Then keep that grain explicit with YIELD and named projections. That is the difference between a useful planner-facing example and a vague call that downstream tooling cannot safely compose. For contract-driven procedures, the executable examples on these pages intentionally inspect procedure metadata unless the required named artifacts are created in the same example.

How It Differs From Nearby Algorithms

Kruskal differs from Prim mostly in growth strategy, not in the final optimization target.

Advanced Example

This example yields named columns from kruskal and returns a bounded result shape that downstream planner tooling can compose without guessing column names or row grain.

CALL nexyron.kruskal() YIELD source, target, weight
RETURN source, target, weight
LIMIT 10

Real Use Cases

Real Limitations And Tradeoffs