dijkstra/main.cpp at master · Adatorm/dijkstra · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/*
 * main.cpp
 *
 *  Created on: 12 Kas 2015
 *      Author: Guner
 */

/* start vertex e hedef vertex girilir,hangi vertex ten baslanilacaksa verilen
 * pred arrayinin ilgili indexindeki contente bakilir. Alinan bu deger yine ayni yontem ile
 * hedef vertex olarak secilen degere ulasilana kadar devam ettirilir.
 *
 *
 */
#include "DijkstrasAlgorithm.h"
#include <iostream>
using namespace std;

int main()
{
	Graph g = Graph(false, 5);
	g.insert(Edge(0, 2, 1));
	g.insert(Edge(0, 1, 2));
	g.insert(Edge(1, 4, 2));
	g.insert(Edge(2, 3, 1));
	g.insert(Edge(3, 4, 1));
	g.insert(Edge(2, 4, 3));
	g.insert(Edge(0, 4, 5));

	double d[5];
	int p[5];
	int start=0;
	DijkstrasAlgorithm::dijkstrasAlgorithm(g, start, p, d);
	for (int i = 0; i < 5; ++i) {
		if(i==start)
		{
			cout << "start-vertex" << " -p "<< i <<"\n";
		}
		else
		{
			cout << p[i] << " -p "<< i <<"\n";
		}

	}
	return 0;
}