Search
Google ClassroomGoogle Classroom
GeoGebraGeoGebra Lesson

Outline

  1. Shortest path
    1. Shortest path on a graph
    2. Dijkstra algorithm (1)
    3. Dijkstra algorithm (2)
    4. Dijkstra algorithm (3)
    5. exercise shortest path (1)
    6. 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

  • Writing and Graphing Proportional Relationships (k>0)
  • Graphing Basic and Compound Inequalities
  • Angle Addition Postulate (V2) - Integer Solutions
  • Congruent Figures
  • GeoGebra 3D Modeling Workshop (March 8 2024)

Discover Resources

  • Triangle inscribed in semi-circle
  • Planet Phases Part 3
  • Untitled
  • Andre HW
  • F.4 trigonometric function (cosine)

Discover Topics

  • Normal Distribution
  • Angles
  • Tree Diagrams
  • Inequalities
  • Solids or 3D Shapes
AboutPartnersHelp Center
Terms of ServicePrivacyLicense
Graphing CalculatorCalculator SuiteMath Resources

Download our apps here:

Download_on_the_App_Store_Badge_US-UK_RGB_blk_4SVG_092917

© 2026 GeoGebra®