bellmanFord: runs in O(V²·E) rather than the O(V·E) / O(E) stated in README #2236

bellmanFord.js (lines 21–39) finds each edge again via graph.findEdge, which is a linear scan of the vertex's edge list, and has no early exit when a pass relaxes nothing. On complete digraphs with unit weights (a best-case input):

Fix: iterate vertex.getEdges() directly (this also fixes #2230) and stop when an iteration changes nothing.

Found during an independent property-based audit of this repo (full report and reproducible harness: https://github.com/devladpopov/algorithm-autopsy/tree/main/autopsy-02).