Source code for the HappyCoders.eu article series on pathfinding algorithms:

• Part 1: Shortest Path Algorithm (With Java Examples)
• Part 2: Dijkstra’s Algorithm (With Java Examples)
• Part 3: A* Search Algorithm (With Java Examples)
• Part 4: Bellman-Ford Algorithm (With Java Examples)
• Part 5: Floyd-Warshall Algorithm (With Java Examples)

• Teil 1: Shortest Path Problem (Kürzeste-Wege-Problem)
• Teil 2: Dijkstra-Algorithmus (mit Java-Beispiel)
• Teil 3: A*-Algorithmus (mit Java-Beispiel)
• Teil 4: Bellman-Ford-Algorithmus (mit Java-Beispiel)
• Teil 5: Floyd-Warshall-Algorithmus (mit Java-Beispiel)

With this 1-page PDF cheat sheet, you'll always have the 7 most important complexity classes at a glance.

• Always choose the most efficient data structures and thus increase the performance of your applications.
• Be prepared for technical interviews and confidently present your algorithm knowledge.
• Become a sought-after problem solver and be known for systematically tackling complex problems.

👉 Download the Big O Cheat Sheet

(Hier geht's zur deutschen Version → O-Notation Cheat Sheet)

Stay up-to-date with the latest Java features with this PDF Cheat Sheet!

• Avoid lengthy research with this concise overview of all Java versions up to Java 23.
• Discover the innovative features of each new Java version, summarized on a single page.
• Impress your team with your up-to-date knowledge of the latest Java version.

👉 Download the Java Versions PDF

(Hier geht's zur deutschen Version → Java-Versionen PDF)

👉 Want to level up your Java skills? Sign up for the HappyCoders newsletter and get regular tips on programming, algorithms, and data structures!

(Hier geht's zur deutschen Version → HappyCoders-Newsletter deutsch)

Trage dich jetzt auf die Warteliste von „Mastering Data Structures in Java“ ein, und erhalte das beste Angebot!

👉 Zur Warteliste