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 #9190 Screenshot #9191 Screenshot #9192 Screenshot #9193

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
2 months, 1 week ago

Links

Dijkstra's algorithm wiki
https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
Github Repo
https://github.com/duartebranco/Dijkstra-s-Algorithm-for-Shortest-Paths

Statistics

Rating
No ratings.
Downloads
258
↳ this version
133
Views
578
↳ this version
295

Reviews

Nobody has reviewed this file yet.

Versions

  1. Dijkstra's Algorithm for Shortest Paths (published 2 months, 1 week ago; 2024-06-30 11:43 UTC)
  2. Dijkstra's Algorithm for Shortest Paths (published 2 months, 1 week ago; 2024-06-29 23:56 UTC)

Advertisement