-
Notifications
You must be signed in to change notification settings - Fork 0
/
dijkstra_visual.c
291 lines (254 loc) · 8.24 KB
/
dijkstra_visual.c
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
/*
* Author: John. Sabbá
* Date: September / 2023
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* Good Luck!
*
* Copyright 2023 John. Sabbá <victorsabba@gmail.com>
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <time.h>
#include <unistd.h>
#include <SDL2/SDL.h>
#include <SDL2/SDL_ttf.h>
#define WINDOW_WIDTH 1280
#define WINDOW_HEIGHT 720
#define MAX_VERTICES 1000
#ifdef INFINITY
#undef INFINITY
#endif
#define INFINITY 9999
typedef struct
{
int x;
int y;
} Point;
// Structure to represent a vertex in the graph
typedef struct
{
int distance;
bool visited;
Point point;
} Vertex;
// Function to find the vertex with the minimum distance
int minDistance(Vertex *vertices, int numVertices)
{
int min = INFINITY;
int minIndex;
for (int v = 0; v < numVertices; v++)
{
if (!vertices[v].visited && vertices[v].distance <= min)
{
min = vertices[v].distance;
minIndex = v;
}
}
return minIndex;
}
// Function to print the shortest path from source to destination
void printShortestPath(int *parent, int dest, Vertex *vertices, SDL_Renderer *renderer)
{
SDL_SetRenderDrawColor(renderer, 0, 255, 0, 255); // Shortest path color
if (parent[dest] == -1)
{
printf("%d ", dest);
return;
}
SDL_RenderDrawLine(renderer, vertices[dest].point.x, vertices[dest].point.y, vertices[parent[dest]].point.x, vertices[parent[dest]].point.y);
SDL_RenderPresent(renderer);
printShortestPath(parent, parent[dest], vertices, renderer);
printf("%d ", dest);
}
// Function to implement Dijkstra's shortest path algorithm
void dijkstra(int graph[MAX_VERTICES][MAX_VERTICES], int numVertices, int src, int dest, SDL_Renderer *renderer)
{
Vertex vertices[MAX_VERTICES];
int parent[MAX_VERTICES];
TTF_Init();
TTF_Font *font = TTF_OpenFont("Arial.ttf", 24);
char str[20];
// Initialize all vertices with maximum distance and not visited
for (int i = 0; i < numVertices; i++)
{
vertices[i].distance = INFINITY;
vertices[i].visited = false;
vertices[i].point.x = rand() % 1100 + 50;
vertices[i].point.y = rand() % 640 + 50;
parent[i] = -1;
SDL_Color textColor;
if (i == src)
{
textColor = (SDL_Color){0, 255, 0, 255};
}
else if (i == dest)
{
textColor = (SDL_Color){255, 0, 0, 255};
}
else
{
textColor = (SDL_Color){255, 255, 255, 255};
}
SDL_Rect rect = {vertices[i].point.x, vertices[i].point.y, 30, 30};
sprintf(str, "%d", i);
SDL_Surface *textSurface = TTF_RenderText_Solid(font, str, textColor);
SDL_Texture *textTexture = SDL_CreateTextureFromSurface(renderer, textSurface);
SDL_RenderCopyEx(renderer, textTexture, NULL, &rect, 0, NULL, SDL_FLIP_NONE);
SDL_FreeSurface(textSurface);
SDL_DestroyTexture(textTexture);
SDL_RenderPresent(renderer);
}
// Distance from source to itself is always 0
vertices[src].distance = 0;
// Find shortest path for all vertices
for (int count = 0; count < numVertices - 1; count++)
{
int u = minDistance(vertices, numVertices);
vertices[u].visited = true;
if (u != dest && u != src)
{
SDL_SetRenderDrawColor(renderer, 255, 165, 0, 127); // Color of visited vertex
}
else if (u == dest)
{
SDL_SetRenderDrawColor(renderer, 255, 0, 0, 127); // Color of destination vertex
}
else if (u == src)
{
SDL_SetRenderDrawColor(renderer, 0, 255, 0, 127); // Color of source vertex
}
SDL_Rect rect = {vertices[u].point.x, vertices[u].point.y, 10, 10};
SDL_RenderFillRect(renderer, &rect);
SDL_RenderPresent(renderer);
for (int v = 0; v < numVertices; v++)
{
if (!vertices[v].visited && graph[u][v] && vertices[u].distance + graph[u][v] < vertices[v].distance)
{
vertices[v].distance = vertices[u].distance + graph[u][v];
parent[v] = u;
SDL_SetRenderDrawColor(renderer, 255, 255, 255, 50);
SDL_RenderDrawLine(renderer, vertices[v].point.x, vertices[v].point.y, vertices[u].point.x, vertices[u].point.y);
}
SDL_RenderPresent(renderer);
usleep(500);
}
}
printf("The shortest path from %d to %d is: ", src, dest);
printShortestPath(parent, dest, vertices, renderer);
printf("\n");
}
int main()
{
int graph[MAX_VERTICES][MAX_VERTICES];
int numVertices;
int src, dest;
printf("Choose an option:\n");
printf("1. Use a pre-defined graph\n");
printf("2. Enter a graph manually\n");
printf("3. Generate a random graph\n");
int option;
scanf("%d", &option);
if (option == 1)
{
// Use pre-defined graph
int predefinedGraph[9][9] = {{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}};
numVertices = 9;
for (int i = 0; i < numVertices; i++)
{
for (int j = 0; j < numVertices; j++)
{
graph[i][j] = predefinedGraph[i][j];
}
}
}
else if (option == 2)
{
// Enter graph manually
printf("Enter the number of vertices: ");
scanf("%d", &numVertices);
printf("Enter the adjacency matrix:\n");
for (int i = 0; i < numVertices; i++)
{
for (int j = 0; j < numVertices; j++)
{
scanf("%d", &graph[i][j]);
}
}
}
else if (option == 3)
{
// Generate random graph
srand(time(NULL)); // Seed random number generator with current time
printf("Enter the number of vertices: ");
scanf("%d", &numVertices);
for (int i = 0; i < numVertices; i++)
{
for (int j = 0; j < numVertices; j++)
{
if (i == j)
{
graph[i][j] = 0; // No self-loops in the graph
}
else
{
if (rand() % 10 < 9) {
graph[i][j] = 0;
} else {
graph[i][j] = rand() % 10;
}
}
}
}
}
printf("Enter the source vertex: ");
scanf("%d", &src);
printf("Enter the destination vertex: ");
do
{
printf("Enter the destination vertex (must be smaller than %d): ", numVertices);
scanf("%d", &dest);
} while (dest >= numVertices);
// Initialize SDL
SDL_Window *window;
SDL_Renderer *renderer;
SDL_Init(SDL_INIT_VIDEO);
SDL_CreateWindowAndRenderer(WINDOW_WIDTH, WINDOW_HEIGHT, 0, &window, &renderer);
// Set the blend mode to enable transparency
SDL_SetRenderDrawBlendMode(renderer, SDL_BLENDMODE_BLEND);
SDL_SetRenderDrawColor(renderer, 0, 0, 0, 255);
SDL_RenderClear(renderer);
SDL_RenderPresent(renderer);
dijkstra(graph, numVertices, src, dest, renderer);
bool quit = false;
SDL_Event event;
while (!quit)
{
while (SDL_PollEvent(&event))
{
if (event.type == SDL_QUIT)
quit = true;
}
}
SDL_DestroyRenderer(renderer);
SDL_DestroyWindow(window);
SDL_Quit();
return 0;
}