dagger
dagger copied to clipboard
dagger is a fast, concurrency safe, mutable, in-memory directed graph library. Also includes a number of generic, concurrency safe data-structures
Results
2
dagger issues
Sort by
recently updated
recently updated
newest added
Bro, a shortest path search function should be better。
dag: A->B->C ``` func (g *Graph) DFS(edgeType string, rootNode Path, fn func(nodePath Node) bool) { ... stack := driver.NewInMemStack() ... stack.Range(func(element interface{}) bool { .... } stack.Range uses the pop...