Map a graph to a new graph, with edge converted to new type
Map a graph to a new graph, with edge converted to new type
Map a graph to a new graph, with vertex converted to a new type
Map a graph to a new graph, with vertex converted to a new type
Return an iterator of vertex in topological order
Generate a level map for each vertex withholding: if vertex A -> B, then level(A) < level(B)
Application DAG