Search:

I actually figured it out as I was thinking through it at work today.

It turns out that every time I called my algorithm, it edited the neighbors of each vertex.

What I ended up doing to...

By errors here I just mean errors in the distances I am getting back.

Ex: In the second set of results, 5 to 5 is dist 2 and 5 to 4 is zero

I am working on a project where I am attempting to find the central node, I think I heard it called a "Jordan node" of a graph network. I believe the best way to start this would be to run Dijkstra's...