FilesExpand file tree

main

/

Dijkstra_Algorithm.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

72 lines (64 loc) · 1.33 KB

main

/

Dijkstra_Algorithm.c

Copy path

Top

File metadata and controls

• Code
• Blame

72 lines (64 loc) · 1.33 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <stdio.h>

#include <limits.h>

#define V 5

int minDistance(int dist[], int Visited[])

{

int min = INT_MAX, min_index;

for (int i = 0; i < V; i++)

{

if (Visited[i] == 0 && dist[i] < min)

{

min = dist[i];

min_index = i;

}

}

return min_index;

}

void printSolution(int dist[])

{

printf("Vertrx\tDistance Form Source\n");

for (int i = 0; i < V; i++)

{

printf("%d\t%d\n", i, dist[i]);

}

}

void dijkstra(int graph[V][V], int src)

{

int dist[V];

int visited[V];

for (int i = 0; i < V; i++)

{

dist[i] = INT_MAX;

visited[i] = 0;

}

dist[src] = 0;

for (int count = 0; count < V - 1; count++)

{

int u = minDistance(dist, visited);

visited[u] = 1;

for (int v = 0; v < V; v++)

{

if (!visited[v] &&

graph[u][v] != 0 &&

dist[u] != INT_MAX &&

dist[u] + graph[u][v] < dist[v])

{

dist[v] = dist[u] + graph[u][v];

}

}

}

printSolution(dist);

}

int main()

{

int graph[V][V] = {

{0, 10, 0, 5, 0},

{0, 0, 1, 2, 0},

{0, 0, 0, 0, 4},

{0, 3, 9, 0, 2},

{7, 0, 6, 0, 0}};

int source = 0;

dijkstra(graph, source);

return 0;

}

// test