Dijkstra's Algorithm for Shortest Paths
  1. All files
  2. TI-84 Plus CE Programs
  3. TI-84+ CE Python programs

Description

This program implements Dijkstra's algorithm to find the shortest path between nodes in a graph on the TI-84 graphing calculator using Python. It allows users to input the number of nodes and the weights between pairs of nodes, and then calculates the shortest path and distance between a specified source and destination node. The program handles up to 26 nodes and infinite weights are denoted by 'i'.

Screenshots

Screenshot #9186 Screenshot #9187 Screenshot #9188 Screenshot #9189

Archive Contents
Name Size
Dijkstra.py 3.4 KB
Download file
File Size
1.1 KB
Short link
http://ceme.tech/DL2495

Metadata

Author
duartebranco
Uploaded

Links

Dijkstra's algorithm wiki
https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Statistics

Rating
No ratings.
Downloads
880
↳ this version
410
Views
1331
↳ this version
443

Reviews

Nobody has reviewed this file yet.

Versions

  1. Dijkstra's Algorithm for Shortest Paths (published 10 months, 3 weeks ago; 2024-06-30 06:43 UTC-05:00)
  2. Dijkstra's Algorithm for Shortest Paths (published 10 months, 3 weeks ago; 2024-06-29 18:56 UTC-05:00)

Advertisement