Scribd
Upload
26 views3 pages

Tcoa24 - Daa

The document contains source code implementing Dijkstra's algorithm to find the shortest paths between nodes in a graph, taking as input an adjacency matrix representing the graph and starting node, it initializes distances and tracks explored nodes, iteratively finding the unexplored node closest to the source and updating distances through neighbors until all nodes are explored. The code includes functions to find the minimum distance node, print the results, and implements the core Dijkstra's algorithm to find shortest paths from the source to all other nodes in the graph.

Uploaded by

Jayant Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
26 views3 pages

Tcoa24 - Daa

The document contains source code implementing Dijkstra's algorithm to find the shortest paths between nodes in a graph, taking as input an adjacency matrix representing the graph and starting node, it initializes distances and tracks explored nodes, iteratively finding the unexplored node closest to the source and updating distances through neighbors until all nodes are explored. The code includes functions to find the minimum distance node, print the results, and implements the core Dijkstra's algorithm to find shortest paths from the source to all other nodes in the graph.

Uploaded by

Jayant Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

G. H. Raisoni College of Engineering and Management, Pune.

(An Autonomous Institution)


CAE-3 Summer -2020 (2016 Pattern)
[Time: 3 Hours] [ Max. Marks 20]

Examination: CAE 3 Registration. No.: 2016ACOE0012037

Branch: Computer Engineering Roll No.: TCOA24

Subject: DAA Student Name :fdgjhgfghjsgj

Date:09 /04 /2020 Student Sign:

Marks: Total 20 I have seen the answer sheet :

---------------------------------------------------------------------------------------------------------------------------

C03 :

i) Dijkstra Algorithm

#include <limits.h>

#include <stdio.h>

#define V 9

int minDistance(int dist[], bool sptSet[])

int min = INT_MAX, min_index;

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

if (sptSet[v] == false && dist[v] <= min)

min = dist[v], min_index = v;

return min_index;

int printSolution(int dist[])


{

printf("Vertex \t\t Distance from Source\n");

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

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

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

int dist[V];

bool sptSet[V];

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

dist[i] = INT_MAX, sptSet[i] = false;

dist[src] = 0;

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

int u = minDistance(dist, sptSet);

sptSet[u] = true;

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

if (!sptSet[v] && graph[u][v] && 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, 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);

return 0;

Output

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy