BSD-3-Clause licensed by Oleg Grenrus
Maintained by Oleg.Grenrus

Module documentation for 1

This version can be pinned in stack with:topograph-1@sha256:315dfa22bfdc94ce67380c989b4ce304477ec982e1d663895607eaabc3159169,1598

Directed acyclic graphs can be sorted topographically. Existence of topographic ordering allows writing many graph algorithms efficiently. And many graphs, e.g. most dependency graphs are acyclic!

There are some algorithms build-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!

Used by 1 package in nightly-2019-11-29(full list with versions):
comments powered byDisqus