Change Dijkstra's algorithm to return all shortest distances

2025-05-14 20:53:39 +02:00
parent 73ead5aea7
commit 897bab12bf
2 changed files with 8 additions and 15 deletions
--- a/include/aoc/common/WeightedEdgeGraph.hpp
+++ b/include/aoc/common/WeightedEdgeGraph.hpp
@@ -28,7 +28,7 @@ class WeightedEdgeGraph
    void addEdge(const int vertex1, const int vertex2, const int weight);
    int getVertexWeight(const int vertex) const;
    int getEdgeWeight(const int edge) const;
-    int dijkstra(const int source, const int target) const;
+    std::vector<int> dijkstra(const int source) const;

    struct Incidence
    {