搜尋
Google ClassroomGoogle Classroom
GeoGebraGeoGebra Classroom

綱要

  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

作者:chris cambré
主題:函數圖形, 直線
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)

下一步
Shortest path on a graph

最新資源

  • Linear Combination of Vectors
  • Midpoint Theorem (V2): Integer Solutions
  • Writing and Graphing Proportional Relationships (k>0)
  • Odd Function Explorer
  • Rotating Custom Polygons Around an Axis

探索資源

  • Equation of the line
  • Challenge 2
  • Triangle_Revised
  • Florero
  • PTX Eigenvector Graded Example

探索主題

  • 多項式函數
  • 正切函數
  • 3D 立體形
  • 微分
  • 不等邊三角形
關於合作夥伴支援中心
服務條款隱私版權
繪圖計算機計算機套件課程資源

在這裡下載我們的 App:

Download_on_the_App_Store_Badge_US-UK_RGB_blk_4SVG_092917

© 2026 GeoGebra®