- data structure
- path finding
- shortest path
- View more
Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.
simple and reasonably fast implementation of directed acyclic graphs and sets with focus on finding the fastest execution order of interdependent tasks