Graph Algorithms

This toolbox makes use of a number of the graph algorithms provided in the Graphs.jl package. In addition, we have implemented a number of graph algorithms that you may find useful when developing analytics around curriculum graphs. The functions implementing these algorithms are described next.

Missing docstring.

Missing docstring for dfs. Check Documenter's build log for details.

Missing docstring.

Missing docstring for gad. Check Documenter's build log for details.

Missing docstring.

Missing docstring for all_paths. Check Documenter's build log for details.

Missing docstring.

Missing docstring for longest_path. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reachable_from. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reachable_from_subgraph. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reachable_to. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reachable_to_subgraph. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reach. Check Documenter's build log for details.

Missing docstring.

Missing docstring for reach_subgraph. Check Documenter's build log for details.

Missing docstring.

Missing docstring for topological_sort. Check Documenter's build log for details.