goraph

goraph copied to clipboard

I am trying to use `goraph` with the output from Golang callgraph [1], which is like this: ~~~ "prog/test.A" "prog/test.C" "prog/test.A" "prog/test.D" "prog/test.main" "prog/test.A" "prog/test.B" "prog/test.E" "prog/test.B" "prog/test.F" "prog/test.main" "prog/test.B"...

89z

Situation: * need for a count of all edge of a Graph * need for a count of all edge of a Node Problem: * Graph Interface does not provide...

thomaspeugeot

Situation: I have a graph with close to 2 Millions nodes and many more edges Problem: call to Tarjan provokes a stack limit error Note: goraph is great piece of...

thomaspeugeot

Can I use the Dijkstra function to generate a shortest path tree if no target is specified

1

Hi, As I want to generate a shortest path tree, can I use the the Dihkstra function in goraph to generate a shortest path tree if I do not specified...

peter-hon

Export an Error to signify missing nodes

2

goraph uses `errors.New()` to create errors to signal missing graph nodes in numerous places. e.g. `return fmt.Errorf("%s does not exist in the graph.", id1)` It would be better to create...

beano

Iterative TopologicalSortVisit

1

topologicalSortVisit can be converted to an iterative method instead of recursion.

ashrwin