Re: Finding shortest path into unweighted undirected graph

mensanator, I'm interested in your neighboor algoritm of creating
graphs? This is what I will need someday. By now path seems short with
random (max 4) links between nodes - the longest path I've discovered
is about 15-20 nodes in a set of 10000 nodes.
Would you explain it a bit more in depth? This problem caught my eye
instantly.
I'll see your other data later.
Best regards, Ivan.

.

Loading