v1.0.0 — SoftUni Advanced Algorithms with Java

Complete solutions for SoftUni Algorithms Advanced course in Java. Graph algorithms: Bellman-Ford shortest paths, Kruskal MST, Prim's cable network, longest path in DAG, most reliable path, cheap town tour, e-shop optimization, eco-friendly highway construction.

Algorithms

Algorithm	Problem
Bellman-Ford	Shortest paths with negative weights
Kruskal	Minimum spanning tree
Prim	Cable network optimization
DAG Longest Path	Big trip / longest path
Dijkstra variant	Most reliable path
Greedy	Cheap town tour

Stack

Java | Graph Theory | Dynamic Programming