Topological sort using DFS. More...
#include <TopoSort.h>
Data Structures | |
struct | Result |
Public Member Functions | |
TopoSort (GraphT *graph) | |
Result | run () |
Topological sort using DFS.
This algorithm takes a Graph object and returns node references in topological order.
Definition at line 16 of file TopoSort.h.