Uploaded image for project: 'Spark'
  1. Spark
  2. SPARK-20272

about graph shortestPath algorithm question

    Details

    • Type: Question
    • Status: Resolved
    • Priority: Major
    • Resolution: Invalid
    • Affects Version/s: 2.1.0
    • Fix Version/s: None
    • Component/s: GraphX
    • Labels:
      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.

        Attachments

          Activity

            People

            • Assignee:
              Unassigned
              Reporter:
              jackHuang huangjunjun
            • Votes:
              0 Vote for this issue
              Watchers:
              0 Start watching this issue

              Dates

              • Created:
                Updated:
                Resolved: