diff --git a/Uebung 3/Uebung3_1/extendedgraph.cpp b/Uebung 3/Uebung3_1/extendedgraph.cpp
index 4b8a20e..5c31940 100644
--- a/Uebung 3/Uebung3_1/extendedgraph.cpp	
+++ b/Uebung 3/Uebung3_1/extendedgraph.cpp	
@@ -1,4 +1,5 @@
 #include "extendedgraph.h"
+#include <map>
 
 ExtendedGraph::ExtendedGraph() { //  Default Constructor
   this->vertices =
@@ -220,4 +221,24 @@ int ExtendedGraph::resolveVertex(const std::string &vertexName) {
     }
   }
   return -1;
+}
+
+void ExtendedGraph::performDijkstraPath(std::string sourceVertex,
+                                        std::string targetVertex) {
+
+  int distances[this->vertices.size()] = {INT_MAX};
+  bool visited[this->vertices.size()] = {false};
+  distances[this->resolveVertex(sourceVer)] = 0;
+
+  visited[this->resolveVertex(sourceVer)] = true;
+
+  for (int i = 0; i < this->vertices.size(); i++) {
+  }
+
+  std::vector<std::pair<bool, int>> data;
+  std::string currentVertex = sourceVertex;
+  // std::map<std::string, int> sptSet;
+
+  for (const std::string &neighbour : this->neighbours(currentVertex)) {
+  }
 }
\ No newline at end of file
diff --git a/Uebung 3/Uebung3_1/extendedgraph.h b/Uebung 3/Uebung3_1/extendedgraph.h
index ef2bd14..01de360 100644
--- a/Uebung 3/Uebung3_1/extendedgraph.h	
+++ b/Uebung 3/Uebung3_1/extendedgraph.h	
@@ -63,4 +63,5 @@ public:
                            //  neighbouring vertices of the parameter vertex...
                            //  ...Neighbours are all vertices that a given
                            //  vertex is connected to through OUTGOING edges
+  void performDijkstraPath(std::string sourceVertex, std::string targetVertex);
 };
\ No newline at end of file