We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 756b95c commit e86d188Copy full SHA for e86d188
C++/shortest-cycle-in-a-graph.cpp
@@ -20,7 +20,7 @@ class Solution {
20
vector<int> new_q;
21
for (const auto& u : q) {
22
for (const auto& v : adj[u]) {
23
- if (dist[v] == dist[u] - 1) {
+ if (dist[v] == dist[u] - 1) { // v == p
24
continue;
25
}
26
if (dist[v] != INF) {
0 commit comments