Closed UmangBR closed 2 years ago
Later requst: „hey whats the shortest route from A to B“
Storage format is finished and we have basic traversal functions like BFS to check for strong connectivity. Shortest path from A to B needs to be spun up into its own issue.
The Dijkstra Algorithm is followed to find the Shortest Distance Between the Nodes. For a Default Graph from Vmap it was Difficult to Implement As a First Step or Skeleton Preparation , The Algorithm is implemented for above simple map and it works successfully
User story
Acceptance criteria
Definition of done (DoD)
DoD general criteria