Skip to content

Update exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Pro… #704

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 14, 2025
Merged

Update exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Pro… #704

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions ...h Problem/exerc_3-Applying Dijkstra's Algorithm to the Shortest Path Problem.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@

```markdown

## Example 3: Step-by-Step Tableau for Dijkstra's Algorithm

Below are the tableaus (tabulações) representing each iteration of Dijkstra's algorithm for Example 3, as described in the PDF[^1].
Expand Down Expand Up @@ -90,7 +90,7 @@ Below are the tableaus (tabulações) representing each iteration of Dijkstra's
- **Total Time:** 65 seconds

These tableaus follow the standard Dijkstra's procedure, allowing step-by-step verification and understanding of the shortest path calculation in the network.
```


[

[