dijkistragraphical/Main.cpp at master · kishore-ganesh/dijkistragraphical · 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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#include"stdafx.h"
#include "DataStructures.h"
#include "Graphics.h"
#include<time.h>
#include<thread>
//highlight start node and end node


//twitter bot// appi
//make flappy bird better with physics engine

//thread for gui quitting

//refactoring

//clear on screen after finding

//draw nodes in proportion to their distance (random*nodedistancfe?)


//threads

//random nodes shouldn't be equal to chosen before


int main(int argc, char* argv[])
{
	srand(time(0));

	//initializeSDL();
	Graph agraph;

	std::thread athread(displaythread);


	SDL_Delay(100);
	//SDL_DestroyWindow(window);

	if(texture==NULL)
	{
		cout << "NULL";
	}


	for (int i = 0; i < 10; i++)
	{
		int x, y;
		x = rand() % 750;
		y = rand() % 550;
		agraph.AddVertice(x, y);


	}


	for (int i = 0; i < 10; i++)
	{
		int randvar = rand() % 11;
		//   cout<<" "<<randvar;
		if (randvar < 10)
		{
			int randomvariable1 = rand() % agraph.NodeArray.size();
			int randomvariable2 = rand() % agraph.NodeArray.size();
			//cout<<"\n "<<randomvariable1<<" "<<randomvariable2;
			int randdist = rand() % 30;

			if ((randomvariable1 != randomvariable2) && randdist != 0)
			{
				agraph.AddEdge(agraph.NodeArray[randomvariable1], agraph.NodeArray[randomvariable2], randdist);
			}

		}

	}


	//SDL_RenderClear;
	agraph.setup();


	agraph.ConnectedTo();
	//athread.join();

	for (int i = 0; i < 10; i++)
	{


		int randomvariable1 = rand() % agraph.NodeArray.size();
		int randomvariable2 = rand() % agraph.NodeArray.size();


		if (randomvariable1 != randomvariable2)
		{

			SDL_RenderPresent(renderer);
		//	std::thread anotherthread(&Graph::shortestpath, agraph, agraph.NodeArray[0], agraph.NodeArray[1]);
			//anotherthread.join();
			agraph.shortestpath(agraph.NodeArray[randomvariable1], agraph.NodeArray[randomvariable2]);
			//agraph.startshorestpath(agraph.NodeArray[randomvariable1], agraph.NodeArray[randomvariable2]);
		//	athread=std::thread(&Graph::shortestpath, agraph, agraph.NodeArray[randomvariable1], agraph.NodeArray[randomvariable2]);
			agraph.cleanup();

			SDL_RenderPresent(renderer);


		}


	}


	cout << "Number of successful outcomes: " << Graph::successes;

//	athread.join();


	return 0;
}