Hi,
I'm running a singlePairShortestPathBFS very similar to what is given in the example code with maxhops set to 5.
I test this with random source, destination vertex pairs and time it.
For some pairs of vertices it finds that no paths(cost=0) very quickly. while for other pairs finding there are no paths(cost=0) takes a longer time. Same is the case for path costs>0.
I need some statistic that will explain this time difference, as cost is not the suitable one.
Is there any other statistic I can get from after running the algorithm? Maybe the number of different paths explored to find shortest path etc..?
Thanks!