Details
-
Question
-
Status: Resolved
-
Major
-
Resolution: Invalid
-
2.1.0
-
None
-
None
Description
we all know that shortestPath algorithm should be to comput the distance between source vertex id and destination vertex id.In fact, the shortestPath algorithm in graphX is computting the least passed vertex number from source to destination.