This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Topological sort Home 🌙 Topological sort In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v , u comes before v in the ordering. — Topological sorting , Wikipedia Math terminology aside, a topological sort allows you take a series of "a comes before b" commands a…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.