Add shortest path iterator #5

Activity

1. octavonce

   added this to the 0.2 milestone on Mar 14, 2019
2. octavonce

   added

   featureA feature to be implementedA feature to be implemented

   on Mar 14, 2019
3. cherrygot-personal commented on Mar 18, 2019

   

   cherrygot-personal

   on Mar 18, 2019

   Contributor

   More actions

   What should be preferred? Bellman–Ford or Dijkstra's algorithm. Or both!
4. octavonce commented on Mar 19, 2019

   

   octavonce

   on Mar 19, 2019

   ContributorAuthor

   More actions

   Yes! We can certainly do both!

   We can expose them as Graph::bellman_ford() and Graph::dijkstra().
5. cherrygot-personal commented on Mar 25, 2019

   

   cherrygot-personal

   on Mar 25, 2019

   Contributor

   More actions

   I was trying to implement the Dijkstra algorithm, but found that there is no method to get the weight of edge between two vertices. Maybe you can help. If I have 'VertexId's of two nodes, how would I know weight of edge between them?
6. octavonce commented on Mar 25, 2019

   

   octavonce

   on Mar 25, 2019

   Last edited by octavonce

   ContributorAuthor

   More actions

   Maybe we need to do these first: #4 #3 and also include a Graph::weight method which receives as parameters two VertexId structs.
7. octavonce

   added a commit that references this issue on Nov 22, 2019

   Merge pull request #5 from sn99/dependabot/cargo/criterion-0.3.0

   ...

   56a1924
8. cemeyer commented on Dec 9, 2021

   

   cemeyer

   on Dec 9, 2021

   More actions

   Graph::dijkstra() and iterator::Dijkstra exist now.
9. saona-raimundo commented on Jan 12, 2022

   

   saona-raimundo

   on Jan 12, 2022

   More actions

   Sorry if this is out of nowhere, but would it not be a more productive approach to implement the traits in petgraph to get access to all their algorithms implemented in petgraph::algo?

   Is it because of the no-std option that this route was not taken?