# Is it possible for a network to have a negative cycle that is not found by the Bellman–Ford algorithm?

I'm struggling to think of such a network. According to the definition I'm working with:

Given a network $$(V, A, w)$$.

For all arcs $$(u, v) \in A$$ :

$$\quad$$ If $$d[u, |V| - 1] + w(u, v) < d[v, |V| - 1]$$:

$$\quad\quad$$ Print “Negative cycle!” and stop immediately

To me this implies the only way a negative cycle isn't detected is if all arcs from any $$u$$ to my $$v$$ must have a positive weight. How, then, could there be a negative cycle?

Simply put, the algorithm initializes the distance to the source to 0 and all other nodes to infinity. Then for all edges, if the distance to the destination can be shortened by taking the edge, the distance is updated to the new lower value. At each iteration $$i$$ that the edges are scanned, the algorithm finds all shortest paths of at most length $$i$$ edges (and possibly some paths longer than $$i$$ edges). Since the longest possible path without a cycle can be $$|V|-1$$ edges, the edges must be scanned $$|V|-1$$ times to ensure the shortest path has been found for all nodes. A final scan of all the edges is performed and if any distance is updated, then a path of length $$|V|$$ edges has been found which can only occur if at least one negative cycle exists in the graph.
Exercise. Let $$e_0, e_1, e_2, \cdots, e_{m-1}, e_m=e_0$$ be a negative cycle whose number of vertices, $$m$$ is the smallest among all negative cycles. Show that it is a chordless cycle.