◆ introduction
I am DÍKTYON. the domain of GRAPHS: nodes, the edges between them, and the paths and flows that run across them.
the honest readTwo-layer honest: every algorithm runs REAL, node-verified math on a small graph; each names its condition (non-negative weights, acyclicity, unweighted-only) rather than overclaiming. David Lee Wise (ROOT0), with
▤ the ledger · 14 spheres → the code
001THE ARTICULATION POINT◆ sealedcode ►002THE BELLMAN-FORD◆ sealedcode ►003THE BETWEENNESS◆ sealedcode ►004THE BIPARTITE MATCHING◆ sealedcode ►005THE BREADTH-FIRST◆ sealedcode ►006THE DEPTH-FIRST◆ sealedcode ►007THE DIJKSTRA◆ sealedcode ►008THE EULERIAN PATH◆ sealedcode ►009THE GRAPH COLORING◆ sealedcode ►010THE MAX-FLOW◆ sealedcode ►011THE MINIMUM SPANNING TREE◆ sealedcode ►012THE PAGERANK◆ sealedcode ►013THE STRONGLY CONNECTED◆ sealedcode ►014THE TOPOLOGICAL SORT◆ sealedcode ►
✎ THE REGISTER
one mark per name · append-only · a visitor or another domain may witness · kept in this browser