GeoGebra
GeoGebra
  • Shortest path
      Shortest path on a graph
      Dijkstra algorithm (1)
      Dijkstra algorithm (2)
      Dijkstra algorithm (3)
      exercise shortest path (1)
      exercise shortest path (2)

Shortest path

Author:
chris cambré
Topic:
Function Graph, Straight Lines
What's the shortest path between two points on a graph? The algorithm of Dijkstra is a way to find it. Explore step by step the algorithm and make some exercises yourself.

  • Shortest path on a graph

  • Dijkstra algorithm (1)

  • Dijkstra algorithm (2)

  • Dijkstra algorithm (3)

  • exercise shortest path (1)

  • exercise shortest path (2)

Next
Shortest path on a graph

New Resources

  • exterior small panels
  • One Point of Inflection
  • Area of the Shaded Region (1)
  • interior - wal panels - gp
  • Bibi Khanun mosque - gear pattern - ks

Discover Resources

  • forstørre trekanter
  • Transformations
  • Line Diagram
  • CS-12-13
  • Cube Root Parent Function

Discover Topics

  • Statistical Characteristics
  • Similarity Transformation or Similarity
  • Cone
  • Complex Numbers
  • Root

GeoGebra

  • About
  • Partners
  • GeoGebra on Tests
  • News Feed
  • App Downloads

Apps

  • Calculator Suite
  • Graphing Calculator
  • 3D Calculator
  • CAS Calculator
  • Scientific Calculator

Resources

  • Classroom Resources
  • Learn GeoGebra
  • Classroom
  • Geometry
  • Notes
  • Terms of Service Privacy License
  • Facebook Twitter YouTube