Search
Google ClassroomGoogle Classroom
GeoGebraGeoGebra Classroom

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

  • Cartesian vs Polar
  • Rolling an Equilateral Triangle
  • Fourier Lissajous (Mechanical)
  • Viviani's Curve
  • גיליון אלקטרוני להעלאת נתוני בעיה ויצירת גרף בהתאם

Discover Resources

  • Archimedes principle
  • Sezioni cono (24 Ott 2017)
  • Funzioni goniometriche
  • HARMONIC MEAN

Discover Topics

  • Piecewise Functions
  • Secant Line or Secant
  • LCM and GCD
  • Root
  • Matrices
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®