Skip to content

GitLab

Please use the issue tracker only to report bugs (i.e. errors in the library that need to be fixed) or feature requests.

For questions about how to compile, install or use the library, please use instead the mailing list at https://graph-tool.skewed.de/mailing
(If unsure, use the mailing list first.)



When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.

Closed
Created by Pavol Lukča@pavol.lukca

Topological sort is actually reversed topological sort?

Function graph_tool.topology.topological_sort(g) 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". However, topological sort is almost everywhere (except Boost Graph Library) defined as "linear ordering of vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering".

I think it should be at least emphasised in documentation that it's not "real" topological sort. It's a bit confusing now.