Issues

• C++ Dijkstra keeps the last of several parallel edges, so the shortest path depends on argument order

  objectionary/eo-graphs#85 · Filter by author gemshrine opened on Oct 11, 2026

• Java Dijkstra keeps the last of several parallel edges, so the shortest path depends on argument order

  objectionary/eo-graphs#84 · Filter by author gemshrine opened on Oct 11, 2026

• C++ Prim keeps the last of several edges between two vertices, so it can return a heavier tree than Kruskal

  objectionary/eo-graphs#83 · Filter by author gemshrine opened on Oct 11, 2026

• Java Ford-Fulkerson keeps only the last of two parallel edges, while the C++ version adds their capacities

  objectionary/eo-graphs#82 · Filter by author gemshrine opened on Oct 11, 2026

• EO Prim includes a self-loop in the spanning tree

  objectionary/eo-graphs#81 · Filter by author gemshrine opened on Oct 10, 2026

• C++ Prim ignores edge weights at or above its INF sentinel

  objectionary/eo-graphs#80 · Filter by author gemshrine opened on Oct 10, 2026

• C++ MST entry points index by sparse vertex labels

  objectionary/eo-graphs#79 · Filter by author gemshrine opened on Oct 10, 2026

• C++ Prim ignores valid zero-weight edges

  objectionary/eo-graphs#78 · Filter by author gemshrine opened on Oct 10, 2026

• PrimMST returns a partial component for disconnected graphs

  objectionary/eo-graphs#77 · Filter by author gemshrine opened on Oct 10, 2026

• Dijkstra entry point crashes with ArrayIndexOutOfBoundsException when a vertex id exceeds the argument count

  objectionary/eo-graphs#75 · Filter by author gemshrine opened on Sep 23, 2026

• Ford-Fulkerson entry point sizes the graph by argument count, not by vertex id range, so it crashes on any vertex id >= args.length

  objectionary/eo-graphs#74 · Filter by author gemshrine opened on Sep 22, 2026

• C++ Ford-Fulkerson writes past fixed arrays above 1000 vertices

  objectionary/eo-graphs#72 · Filter by author gemshrine opened on Sep 16, 2026

• Prim implementations crash on an empty graph

  objectionary/eo-graphs#71 · Filter by author gemshrine opened on Sep 16, 2026

• EO MST algorithms index collections with sparse vertex labels

  objectionary/eo-graphs#70 · Filter by author gemshrine opened on Sep 16, 2026

• PrimMST.getWeight overflows the total edge weight

  objectionary/eo-graphs#69 · Filter by author gemshrine opened on Sep 16, 2026

• Kruskal edge comparator overflows for extreme weights

  objectionary/eo-graphs#68 · Filter by author gemshrine opened on Sep 16, 2026

• Dijkstra accepts negative weights and returns incorrect paths

  objectionary/eo-graphs#67 · Filter by author gemshrine opened on Sep 16, 2026

• Ford-Fulkerson overflows the accumulated maximum flow

  objectionary/eo-graphs#66 · Filter by author gemshrine opened on Sep 16, 2026

• Dijkstra ignores valid zero-weight edges

  objectionary/eo-graphs#65 · Filter by author gemshrine opened on Sep 16, 2026

• Dijkstra returns wrong paths when distance addition overflows

  objectionary/eo-graphs#64 · Filter by author gemshrine opened on Sep 16, 2026

• GraphGenerator silently accepts invalid command-line arguments

  objectionary/eo-graphs#63 · Filter by author gemshrine opened on Sep 16, 2026

• Java Makefile targets do not match javac output paths

  objectionary/eo-graphs#62 · Filter by author gemshrine opened on Sep 16, 2026

• The run target stores exit codes instead of algorithm output

  objectionary/eo-graphs#61 · Filter by author gemshrine opened on Sep 16, 2026

• The make workflow installs an unpinned EO CLI

  objectionary/eo-graphs#60 · Filter by author gemshrine opened on Sep 16, 2026

• CI runs xcop and pdd from moving master branches

  objectionary/eo-graphs#59 · Filter by author gemshrine opened on Sep 16, 2026