Single Source Shortest Path Dijkstra Algorithm In C Code Example


Example: dijkstra algorithm c++

#include<bits/stdc++.h> using namespace std;  int main() { 	int n = 9; 	 	int mat[9][9] = { { 100,4,100,100,100,100,100,8,100},                        { 4,100,8,100,100,100,100,11,100},                        {100,8,100,7,100,4,100,100,2},                        {100,100,7,100,9,14,100,100,100},                        {100,100,100,9,100,100,100,100,100},                        {100,100,4,14,10,100,2,100,100},                        {100,100,100,100,100,2,100,1,6},                        {8,11,100,100,100,100,1,100,7},                        {100,100,2,100,100,100,6,7,100}}; 	 	int src = 0; 	int count = 1; 	 	int path[n]; 	for(int i=0;i<n;i++) 		path[i] = mat[src][i]; 	 	int visited[n] = {0}; 	visited[src] = 1; 	 	while(count<n) 	{ 		int minNode; 		int minVal = 100; 		 		for(int i=0;i<n;i++) 			if(visited[i] == 0 && path[i]<minVal) 			{ 				minVal = path[i]; 				minNode = i; 			} 		 		visited[minNode] = 1; 		 		for(int i=0;i<n;i++) 			if(visited[i] == 0) 				path[i] = min(path[i],minVal+mat[minNode][i]); 					 		count++; 	} 	 	path[src] = 0; 	for(int i=0;i<n;i++) 		cout<<src<<" -> "<<path[i]<<endl; 	 	return(0); }

Comments

Post a Comment

Popular posts from this blog

Are Regular VACUUM ANALYZE Still Recommended Under 9.1?

Answer : VACUUM is only needed on updated or deleted rows in non-temporary tables. Obviously you're doing lots of INSERTs but it's not obvious from the description that you're also doing lots of UPDATEs or DELETEs. These operations can be tracked with the pg_stat_all_tables view, specifically the n_tup_upd and n_tup_del columns. Also, even more to the point, there is a n_dead_tup column that tells, per table, how much rows need to be vacuumed. (see Monitoring statistics in the doc for functions and views related to statistics gathering). A possible strategy in your case would be to suppress the scheduled VACUUM, keeping an eye on this view and checking on which tables the n_dead_tup is going up significantly. Then apply the aggressive VACUUM to these tables only. This will be a win if there are large tables whose rows never get deleted nor updated and the aggressive VACUUM is really necessary only on smaller tables. But keep running the ANALYZE for the optimiz
Read more

Can Feynman Diagrams Be Used To Represent Any Perturbation Theory?

Answer : Diagram machinery works also for perturbation theory in classical statistical mechanics and classical field theories. Generally, various kinds of diagrams constitute a pictorial way of talking about tensor products and their contractions while hiding the multi-linear algebra from the layman. In the simplest case, vertices (or blobs) represent vectors, matrices, tensors; vertices have ingoing and/or outgoing ports; ingoing ports denote (contravariant) ro indices; outgoing ports denote (covariant) co indices; directed arcs between blobs give a pair of equal indices summed over; different base spaces ⇔ \Leftrightarrow ⇔ different arc types; symmetric tensors ⇔ \Leftrightarrow ⇔ undirected diagrams; no labels are needed for internal lines. In many cases, the directed arcs are decorated (as thin, thick, broken,wavy, curly lines), each decoration indicating the presence of a so-called propagator, a function of its label to use as a weight in the sum, which may beco
Read more