backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-03 10:39:42 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
Graph/Dijkstra.cpp
View File

@@ -4,46 +4,52 @@
#include <iostream>
using namespace std;
#define INF 10000010
vector < pair <int,int> > graph[5*100001];
int dis[5*100001];
int dij(vector <pair<int,int> > * v,int s,int * dis) {
priority_queue < pair <int,int> , vector < pair <int,int> >,greater < pair <int,int> > > pq;
vector<pair<int, int>> graph[5 * 100001];
int dis[5 * 100001];
int dij(vector<pair<int, int>> *v, int s, int *dis)
{
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
// source distance to zero.
pq.push(make_pair(0,s));
pq.push(make_pair(0, s));
dis[s] = 0;
int u;
while(!pq.empty()) {
while (!pq.empty())
{
u = (pq.top()).second;
pq.pop();
for( vector <pair <int,int> > :: iterator it = v[u].begin(); it != v[u].end();it++) {
if(dis[u] + it->first < dis[it->second]) {
for (vector<pair<int, int>>::iterator it = v[u].begin(); it != v[u].end(); it++)
{
if (dis[u] + it->first < dis[it->second])
{
dis[it->second] = dis[u] + it->first;
pq.push(make_pair(dis[it->second],it->second));
pq.push(make_pair(dis[it->second], it->second));
}
}
}
}
int main() {
int m,n,l,x,y,s;
int main()
{
int m, n, l, x, y, s;
// n--> number of nodes , m --> number of edges
cin>>n>>m;
for(int i = 0;i < m;i++) {
cin >> n >> m;
for (int i = 0; i < m; i++)
{
// input edges.
scanf("%d%d%d",&x,&y,&l);
graph[x].push_back(make_pair(l,y));
graph[y].push_back(make_pair(l,x)); // comment this line for directed graph
scanf("%d%d%d", &x, &y, &l);
graph[x].push_back(make_pair(l, y));
graph[y].push_back(make_pair(l, x)); // comment this line for directed graph
}
// start node.
scanf("%d",&s);
scanf("%d", &s);
// intialise all distances to infinity.
for(int i = 1;i <= n;i++)
for (int i = 1; i <= n; i++)
dis[i] = INF;
dij(graph,s,dis);
for(int i = 1;i <= n;i++)
if(dis[i] == INF)
cout<<"-1 ";
dij(graph, s, dis);
for (int i = 1; i <= n; i++)
if (dis[i] == INF)
cout << "-1 ";
else
cout<<dis[i]<<" ";
cout << dis[i] << " ";
return 0;
}