pgr_topologicalSort.html

[cvvergara]

sorted_v -> node?
seq gives the sort order
from boost
The topological sort algorithm creates a linear ordering of the vertices such that if edge (u,v) appears in the graph, then v comes before u in the ordering. The graph must be a directed acyclic graph (DAG). The implementation consists mainly of a call to depth_first_search().

I like the name of the function so change the result column name.

[cvvergara]

Maybe DAG = Directed acyclic graphs should have only the cost column?