Init

P4/DijkstraSP.h

@@ -0,0 +1,25 @@
+#pragma once
+#include <vector>
+#include <queue>
+#include <map>
+#include "EdgeWeightedDigraph.h"
+#include "PriorityQueue.h"
+
+class DijkstraSP {
+private:
+    std::map<int, DirectedEdge> edgeTo;
+    std::vector<double> distToVect;
+    Utils::PriorityQueue<int> pq;
+
+    void relax(EdgeWeightedDigraph G, int v);
+
+public:
+    DijkstraSP() {
+    };
+
+    DijkstraSP(EdgeWeightedDigraph G, int s);
+
+    double distTo(int v) const; // Abst<73>nde vom Startvertex zu v
+    bool hasPathTo(int v) const; // <20>berpr<70>ft die existens eines Pfades
+    std::vector<DirectedEdge> pathTo(int v); // Kanten des k<>rzsesten Weges
+};