The second path matrix S(G) collects all the second paths in the graph G. Its characteristic polynomial shows some regularity in several particular graphs, such as paths, cycles, stars and complete ...

* Why do you want to base this on Dijkstra's algorithm, which is designed to find a single shortest-path? Surely there are better options for your base implementation. A quick Google search suggests a ...