mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-29 04:53:55 +08:00
feat: Create Bidirectional Dijkstra Algorithm (#1410)
* Create Bidirectional Dijkstra Modified Dijkstra Algorithm with euclidean distance. * Update Bidirectional Dijkstra * Delete Bidirectional Dijkstra * Create bidirectional_dijkstra.cpp * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update bidirectional_dijkstra.cpp Headers description added * Fixed error in bidirectional_dijkstra.cpp The third test cases didn't pass because there was an error in the Shortest_Path_Distance function in the indexes. The error has been fixed. * Update bidirectional_dijkstra.cpp Change of int into uint64_t * Update bidirectional_dijkstra.cpp * Update bidirectional_dijkstra.cpp Int variables changed to uint64_t type * Update bidirectional_dijkstra.cpp Added description of input parameters * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update graph/bidirectional_dijkstra.cpp Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
committed by
GitHub
parent
a283f2a96f
commit
c8ce6f404c
@@ -79,6 +79,7 @@
|
||||
* [Line Segment Intersection](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp)
|
||||
|
||||
## Graph
|
||||
* [Bidirectional Dijkstra](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/bidirectional_dijkstra.cpp)
|
||||
* [Breadth First Search](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/breadth_first_search.cpp)
|
||||
* [Bridge Finding With Tarjan Algorithm](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/bridge_finding_with_tarjan_algorithm.cpp)
|
||||
* [Connected Components](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/connected_components.cpp)
|
||||
|
||||
Reference in New Issue
Block a user