directed graph

0 (<1)
rhinodavid/dijkstra — An app to compute the shortest path distances between nodes in a directed graph
directed graph

Some additional repos to consider:
dawg — Directed Acyclic Word Graph implementation in Go, with fuzzy search of words in the graph.
Similar Fuzzy string matching
alexaandru/graph — Go directed, weighted (and sub-optimal, but working) graph implementation
golang-graph-traversal-problem — Find the shortest path in a directed acyclic graph

Once a week...

... I send out a list of most interesting Go libraries and apps.
Want to get it?