Support for edge weights about haskell-igraph HOT 3 CLOSED

You can use edge attributes to add edge weights. For example,

gr :: Graph 'D Int Double
gr = fromLabeledEdges [((0,1), 2), ((0,2), 5)]

Then you can access the edge weights using labEdges. I will add the Dijkstra's algorithm when I have time. But a PR is also welcome.

from haskell-igraph.

The Dijkstra's algorithm was added. See 7fd6845.

Usage:

gr :: Graph 'D Int Double
gr = fromLabeledEdges [((0,1), 2), ((0,2), 5)]

-- shortest path without weights
print $ shortestPath gr 0 2 Nothing

-- shortest path with weights
print $ shortestPath gr 0 2 (Just id)

TODO: write some tests.

from haskell-igraph.

I see. I didn't realize the labels were supposed to be used for information like edge weights.

And thanks for implementing Dijkstra!

from haskell-igraph.