"Dijkstra's Weighted Graph Shortest Path in c++" Code Answer's
You're definitely familiar with the best coding language C++ that developers use to develop their projects and they get all their queries like "Dijkstra's Weighted Graph Shortest Path in c++" answered properly. Developers are finding an appropriate answer about Dijkstra's Weighted Graph Shortest Path in c++ related to the C++ coding language. By visiting this online portal developers get answers concerning C++ codes question like Dijkstra's Weighted Graph Shortest Path in c++. Enter your desired code related query in the search bar and get every piece of information about C++ code related question on Dijkstra's Weighted Graph Shortest Path in c++.
Dijkstra's Weighted Graph Shortest Path in c++
VeNOM
on Dec 08, 2020
#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;
}
void 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;
} All those coders who are working on the C++ based application and are stuck on Dijkstra's Weighted Graph Shortest Path in c++ can get a collection of related answers to their query. Programmers need to enter their query on Dijkstra's Weighted Graph Shortest Path in c++ related to C++ code and they'll get their ambiguities clear immediately. On our webpage, there are tutorials about Dijkstra's Weighted Graph Shortest Path in c++ for the programmers working on C++ code while coding their module. Coders are also allowed to rectify already present answers of Dijkstra's Weighted Graph Shortest Path in c++ while working on the C++ language code. Developers can add up suggestions if they deem fit any other answer relating to "Dijkstra's Weighted Graph Shortest Path in c++". Visit this developer's friendly online web community, CodeProZone, and get your queries like Dijkstra's Weighted Graph Shortest Path in c++ resolved professionally and stay updated to the latest C++ updates.
