Topological sorting of vertices in a graph
A topological sorting of a directed acyclic graph is a linear ordering of its nodes where each node comes before all nodes to which it has edges.
- The input graph, should be directed
- Specifies how to use the direction of the edges.
, the sorting order ensures that each node comes before all nodes to which it has edges, so nodes with no incoming edges go first. For
Every DAG has at least one topological sort, and may have many. This function returns a possible topological sort among them. If the graph is not acyclic (it has at least one cycle), a partial topological sort is returned and a warning is issued.
- A numeric vector containing vertex ids in topologically sorted order.
g <- barabasi.game(100) topological.sort(g)