topological sort

noun

Definitions

  1. An ordering of the vertices of a directed graph such that if an edge goes from vertex u…

    An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering.

The neighborhood

Vish — recursive loop

No curated loop yet for topological sort. Loops are being traced one word at a time while the ingestion pipeline matures.

sense glosses and etymology drawn from English Wiktionary · source · CC-BY-SA