https://github.com/egistr/denah-graph-itera
Explore the fastest routes between various points at Institut Teknologi Sumatera (ITERA) using the power of graph theory! This project is part of our major assignment for the Logic and Discrete Mathematics course,
https://github.com/egistr/denah-graph-itera
dijkstra-s-algorithm graph-theory itera shortest-path
Last synced: about 2 months ago
JSON representation
Explore the fastest routes between various points at Institut Teknologi Sumatera (ITERA) using the power of graph theory! This project is part of our major assignment for the Logic and Discrete Mathematics course,
- Host: GitHub
- URL: https://github.com/egistr/denah-graph-itera
- Owner: EgiStr
- Created: 2023-12-01T16:22:38.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-07-06T20:00:37.000Z (almost 2 years ago)
- Last Synced: 2025-01-19T11:44:07.657Z (over 1 year ago)
- Topics: dijkstra-s-algorithm, graph-theory, itera, shortest-path
- Language: Jupyter Notebook
- Homepage: https://jalur-tercepat-itera.streamlit.app/
- Size: 6.65 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# denah-graph-itera
ini adalah project Tugas Besar Logika & Matematika Distrik
# tahap pertama : donwload
dengan cara:
## download zip
* click code warna hijau
* download zip
* extract zip kedalam folder
* buka folder
atau
## clone repository
```python
git clone https://github.com/EgiStr/denah-graph-itera.git
```
# tahap kedua
jalankan code/main.ipynb
# selesai