Hizenberg/Algorithms-snippets
1
0
Fork 0
mirror of https://github.com/Hizenberg469/Algorithms-snippets.git synced 2026-04-19 22:52:23 +03:00
Code Issues Packages Projects Releases Wiki Activity

Binomial Coefficient

Browse Source
This commit is contained in:
Hizenberg
2024-04-10 15:36:18 +05:30
parent 6ddf41feb5
commit bc8374182f
21 changed files with 810 additions and 769 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
Graph Algorithm/dijikstra.cpp
View File

@@ -1,17 +1,17 @@
priority_queue<pii> q;
q.push({0,1});
dist[1]=0;
while(!q.empty()){
pii n=q.top();q.pop();
int weight=n.F,node=n.S;
if( vis[node] )continue;
vis[node]=true;
for(pii& nbr : g[node]){
int n_nbr=nbr.F,n_w=nbr.S;
if( dist[node]+n_w<dist[n_nbr] ){
dist[n_nbr]=dist[node]+n_w;
q.push({-dist[n_nbr],n_nbr});
}
}
priority_queue<pii> q;
q.push({0,1});
dist[1]=0;
while(!q.empty()){
pii n=q.top();q.pop();
int weight=n.F,node=n.S;
if( vis[node] )continue;
vis[node]=true;
for(pii& nbr : g[node]){
int n_nbr=nbr.F,n_w=nbr.S;
if( dist[node]+n_w<dist[n_nbr] ){
dist[n_nbr]=dist[node]+n_w;
q.push({-dist[n_nbr],n_nbr});
}
}
}