summaryrefslogtreecommitdiffstats
path: root/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra
diff options
context:
space:
mode:
authorJérémy Zurcher <jeremy@asynk.ch>2016-11-13 23:14:10 +0100
committerJérémy Zurcher <jeremy@asynk.ch>2016-11-13 23:14:10 +0100
commit33d7d833615fee75b075e6bfb3a459cc02c4cc54 (patch)
tree47544957c0a2757e86d26efda6c2a64493f80e51 /03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra
parent0c0188d855ca9f452b7fe44d51f86661850ca892 (diff)
downloadcoursera-33d7d833615fee75b075e6bfb3a459cc02c4cc54.zip
coursera-33d7d833615fee75b075e6bfb3a459cc02c4cc54.tar.gz
Algorithms : add 03-algorithms_on_graphs 04-paths_in_graphs
Diffstat (limited to '03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra')
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/dijkstra.cpp30
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/016
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01.a1
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/0211
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02.a1
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/035
-rw-r--r--03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03.a1
7 files changed, 55 insertions, 0 deletions
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/dijkstra.cpp b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/dijkstra.cpp
new file mode 100644
index 0000000..757a6c6
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/dijkstra.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using std::vector;
+using std::queue;
+using std::pair;
+using std::priority_queue;
+
+int distance(vector<vector<int> > &adj, vector<vector<int> > &cost, int s, int t) {
+ //write your code her
+ return -1;
+}
+
+int main() {
+ int n, m;
+ std::cin >> n >> m;
+ vector<vector<int> > adj(n, vector<int>());
+ vector<vector<int> > cost(n, vector<int>());
+ for (int i = 0; i < m; i++) {
+ int x, y, w;
+ std::cin >> x >> y >> w;
+ adj[x - 1].push_back(y - 1);
+ cost[x - 1].push_back(w);
+ }
+ int s, t;
+ std::cin >> s >> t;
+ s--, t--;
+ std::cout << distance(adj, cost, s, t);
+}
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01 b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01
new file mode 100644
index 0000000..88e4967
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01
@@ -0,0 +1,6 @@
+4 4
+1 2 1
+4 1 2
+2 3 2
+1 3 5
+1 3
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01.a b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01.a
new file mode 100644
index 0000000..00750ed
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/01.a
@@ -0,0 +1 @@
+3
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02 b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02
new file mode 100644
index 0000000..99e01ee
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02
@@ -0,0 +1,11 @@
+5 9
+1 2 4
+1 3 2
+2 3 2
+3 2 1
+2 4 2
+3 5 4
+5 4 1
+2 5 3
+3 4 4
+1 5
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02.a b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02.a
new file mode 100644
index 0000000..1e8b314
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/02.a
@@ -0,0 +1 @@
+6
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03 b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03
new file mode 100644
index 0000000..0af6eeb
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03
@@ -0,0 +1,5 @@
+3 3
+1 2 7
+1 3 5
+2 3 2
+3 2
diff --git a/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03.a b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03.a
new file mode 100644
index 0000000..3a2e3f4
--- /dev/null
+++ b/03-algorithms_on_graphs/04-paths_in_graphs/01-dijkstra/tests/03.a
@@ -0,0 +1 @@
+-1