Files

7 lines
213 B
Plaintext

Dijkstra vs Bellman-Ford on seeded random graphs
================================================
cases checked : 3000
cases with an unreachable vertex: 2323
disagreements : 0