Skip to content

Shortes-path-dijkstra #45

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
Dennis-Bauer merged 4 commits into from
Jan 12, 2026
Merged

Shortes-path-dijkstra #45

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
bd06212
Setup Problem
Dennis-Bauer Jan 12, 2026
0120353
First solution
Dennis-Bauer Jan 12, 2026
a36a16e
Better solution
Dennis-Bauer Jan 12, 2026
6b7ae99
Merge branch 'main' into shortes-path-dijkstra
Dennis-Bauer Jan 12, 2026
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
2 changes: 1 addition & 1 deletion .vscode/settings.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,5 +6,5 @@
"source.organizeImports.biome": "explicit"
},
"cSpell.language": "en,de-DE",
"cSpell.words": ["amira", "bella", "fibonacci"]
"cSpell.words": ["amira", "bella", "distanz", "fibonacci"]
}
2 changes: 0 additions & 2 deletions Problems/Dependable-Jobs-Schedule/solver.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,8 +14,6 @@ export default function finishAll(taskAmount: number, dependencies: number[][]):
}
}

console.log(dep);

for (let i = 0; i < dependencies.length; i++) {
for (const d of Array.from(dep.entries())) {
if (!canBeFinished.get(d[0])) {
Expand Down
16 changes: 16 additions & 0 deletions Problems/Shortes-Path-Dijkstra/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
# Shortes Path Dijkstra-Algorithmus

This problem is about finding the shortest path between given destinations and the connections between them, where each connection has a specific length.

## Documentation

### Solution Idea

I implemented the Dijkstra-Algorithmus.
You can see [here](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) how this algorithm works.

---

### [Implementation](./solver.ts)

---
Loading