Activity

Texas Instruments: Numb3 Rs: Driving With Djikstra

Curated by ACT

Based off of the hit television show NUMB3RS, this lesson introduces students to one of the prominent algorithms in graph theory used to find shortest paths -- the Djikstra Algorithm. The lesson includes four graphs of increasing difficulty (culminating in a directed graph), in which students must find shortest paths. This lesson could be used as a good springboard into other such algorithms (such as Kruskal's Algorithm, Prim's Algorithm, or the Breadth-First Search) and further study in the field of minimum spanning trees.

5 Views 4 Downloads
Classroom Considerations
  • Knovation Readability Score: 3 (1 low difficulty, 5 high difficulty)