| Title |
User |
Message |
Date Posted |
| The real meaning of the problem |
LucianIlea |
There is an undirected graph having N vertices and M edges. There are K starting vertices. Determine which is the biggest distance from a starting vertex to any other vertex. |
Oct 13, 2019 - 4:53:25 pm UTC |
| Re: Clarification |
wgma00 |
Yes. |
Aug 02, 2015 - 1:24:30 am UTC |
| Clarification |
Serene17 |
Are the salesmen in the different offices working simultaneously in order to minimize the amount of time taken? |
Aug 02, 2015 - 1:05:34 am UTC |
