Documentation ¶ Overview ¶ topological sorting. the prerequisite information forms a directed graph with a node for each course and edges from each course to courses that it depends on. the graph is acyclic: there's no path from a course that leads back to itself Source Files ¶ View all Source files BFS.go main.go Click to show internal directories. Click to hide internal directories.