github.com/looplab/tarjan (go): Package tarjan implements a graph loop detection algorithm called Tarjan's algorithm.  The algorithm takes a input graph and produces a slice where each item is a slice of strongly connected vertices. The input graph is in form of a map where the key is a graph vertex and the value is the edges in for of a slice of vertices.  Algorithm description: http://en.wikipedia.org/wiki/Tarjan’s_strongly_connected_components_algorithm  Based on an implementation by Gustavo Niemeyer (in mgo/txn): http://bazaar.launchpad.net/+branch/mgo/v2/view/head:/txn/tarjan.go
Keywords: go|graph|tarjan|tarjan-algorithm