A sprint is the shortest distance between two nodes, so the longest sprint would be the longest of the shortest/direct paths between any two nodes.
Pseudocode or description of algorithm please (or C++)
|
|
A sprint is the shortest distance between two nodes, so the longest sprint would be the longest of the shortest/direct paths between any two nodes.
Pseudocode or description of algorithm please (or C++)
Bookmarks