From c5d33a159c58e25647732106c7543e9ef3eafbf6 Mon Sep 17 00:00:00 2001
From: EdwardAJ <13517115@std.stei.itb.ac.id>
Date: Fri, 21 Feb 2020 17:05:12 +0700
Subject: [PATCH] Serial Dijkstra completed.
---
.gitignore | 2 ++
dijkstra.c | 103 +++++++++++++++++++++++++++++++++++++++++++++++++++++
2 files changed, 105 insertions(+)
create mode 100644 .gitignore
create mode 100644 dijkstra.c
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..c2ac45e
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,2 @@
+.DS_Store
+prog
diff --git a/dijkstra.c b/dijkstra.c
new file mode 100644
index 0000000..b026e52
--- /dev/null
+++ b/dijkstra.c
@@ -0,0 +1,103 @@
+#include "mpi.h"
+#include <stdio.h>
+#include <stdbool.h>
+#include <stdlib.h>
+#include <limits.h>
+
+int NUMBER_OF_VERTICES = 0;
+
+long getVertexWithMinDistance(long dist[], bool pickedVertices[]) {
+ long minDistance = LONG_MAX;
+ int vertexWithMinDistance = -1;
+
+ for (int vertex = 0; vertex < NUMBER_OF_VERTICES; vertex++) {
+ if (!pickedVertices[vertex] && dist[vertex] <= minDistance) {
+ minDistance = dist[vertex];
+ vertexWithMinDistance = vertex;
+ }
+ }
+ return vertexWithMinDistance;
+}
+
+void dijkstra(int graph[NUMBER_OF_VERTICES][NUMBER_OF_VERTICES], int sourceVertex) {
+
+ // Distance from single source to all of the nodes
+ long dist[NUMBER_OF_VERTICES];
+ bool pickedVertices[NUMBER_OF_VERTICES];
+
+ for (int vertex = 0; vertex < NUMBER_OF_VERTICES; vertex++) {
+ if (vertex == sourceVertex) {
+ dist[vertex] = 0;
+ } else {
+ // Initialize all distance to be infinity.
+ dist[vertex] = LONG_MAX;
+ }
+ pickedVertices[vertex] = false;
+ }
+
+ for (int iteration = 0; iteration < NUMBER_OF_VERTICES - 1; iteration++) {
+ // Get minimum distance
+ int vertexWithMinDistance = getVertexWithMinDistance(dist, pickedVertices);
+
+ // Mark the vertice as picked
+ pickedVertices[vertexWithMinDistance] = true;
+
+ // Update distance value
+ for (int vertex = 0; vertex < NUMBER_OF_VERTICES; vertex++) {
+ if (!pickedVertices[vertex] && graph[vertexWithMinDistance][vertex] && dist[vertexWithMinDistance] != LONG_MAX && dist[vertexWithMinDistance] + graph[vertexWithMinDistance][vertex] < dist[vertex]) {
+ dist[vertex] = dist[vertexWithMinDistance] + graph[vertexWithMinDistance][vertex];
+ }
+ }
+ }
+ // Print solution
+ for (int vertex = 0; vertex < NUMBER_OF_VERTICES; vertex++) {
+ printf("%d to %ld\n", vertex, dist[vertex]);
+ }
+}
+
+int main(int argc, char *argv[]) {
+
+ // Get matrix size from argument vector in , convert to int
+ NUMBER_OF_VERTICES = strtol(argv[1], NULL, 10);
+
+ // Initialize matrix
+ int graph[NUMBER_OF_VERTICES][NUMBER_OF_VERTICES];
+
+ // Fill the matrix with rand() function
+ // for (int i = 0; i < NUMBER_OF_VERTICES; i++) {
+ // for (int j = 0; j < NUMBER_OF_VERTICES; j++) {
+ // graph[i][j] = rand();
+ // }
+ // }
+
+ for (int i = 0; i < NUMBER_OF_VERTICES; i++) {
+ for (int j = 0; j < NUMBER_OF_VERTICES; j++) {
+ scanf("%d", &graph[i][j]);
+ }
+ }
+
+ // graph = { 0, 4, 0, 0, 0, 0, 0, 8, 0,
+ // 4, 0, 8, 0, 0, 0, 0, 11, 0,
+ // 0, 8, 0, 7, 0, 4, 0, 0, 2,
+ // 0, 0, 7, 0, 9, 14, 0, 0, 0,
+ // 0, 0, 0, 9, 0, 10, 0, 0, 0,
+ // 0, 0, 4, 14, 10, 0, 2, 0, 0,
+ // 0, 0, 0, 0, 0, 2, 0, 1, 6,
+ // 8, 11, 0, 0, 0, 0, 1, 0, 7,
+ // 0, 0, 2, 0, 0, 0, 6, 7, 0 };
+
+ // dijkstra(graph, 0);
+
+ // // Print function
+ printf("Matrix: \n");
+ for (int i = 0; i < NUMBER_OF_VERTICES; i++) {
+ for (int j = 0; j < NUMBER_OF_VERTICES; j++) {
+ printf("%d ", graph[i][j]);
+ }
+ printf("\n");
+ }
+ // Send argument vector
+ // MPI_Init(&argc, &argv);
+ dijkstra(graph, 0);
+ // MPI_Finalize();
+}
--
GitLab