Commit b8788bd

authored

Update kth_shortest_path_between_nodes_graph.cpp

1 parent 42b63b9 commit b8788bdCopy full SHA for b8788bd

File tree

-9

lines changed

-9

lines changed

Lines changed: 9 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,8 +3,8 @@`
`3`	`3`	`* Usage : getCost O((V + E) lg(V) * k)`
`4`	`4`	`* Source: https://github.com/dragonslayerx`
`5`	`5`	`*/`
`6`		`-`
`7`		`-int getCost(graph &G, int s, int t, int k) {`
	`6`	`+constint INF = 1e9;`
	`7`	`+int getCost(vector< vector< pair<int,int> > > &G, int s, int t, int k) {`
`8`	`8`	`int n = G.size();`
`9`	`9`	`int dist[MAX], count[MAX];`
`10`	`10`	`for (int i = 0; i < n; i++) {`
`@@ -19,15 +19,15 @@ int getCost(graph &G, int s, int t, int k) {`
`19`	`19`	`int w = node.first;`
`20`	`20`	`Q.pop();`
`21`	`21`	`if ((dist[u] == INF) or (w > dist[u])) { // remove equal paths`
`22`		`-count[u]++;`
`23`		`-dist[u] = w;`
	`22`	`+count[u]++;`
	`23`	`+dist[u] = w;`
`24`	`24`	`}`
`25`	`25`	`if (count[u] <= k) {`
`26`		`- for (int i = 0; i < G[u].size(); i++) {`
`27`		`-int v = G[u][i].first;`
`28`		`-int w = G[u][i].second;`
`29`		`-Q.push(make_pair(dist[u] + w, v));`
`30`		`- }`
	`26`	`+ for (int i = 0; i < G[u].size(); i++) {`
	`27`	`+int v = G[u][i].first;`
	`28`	`+int w = G[u][i].second;`
	`29`	`+Q.push(make_pair(dist[u] + w, v));`
	`30`	`+ }`
`31`	`31`	`}`
`32`	`32`	`}`
`33`	`33`	`return dist[t];`

Comments

(0)