Tag: graphs
Bellman-Ford Algorithm
PHP 7.1+ Single-source shortest path algorithm that handles negative edge weights and detects negative cycles by relaxing all edges V-1 times.
2mo ago
Algorithms advanced
A* Pathfinding Algorithm
4
Heuristic search algorithm that finds the lowest-cost path using f(n)=g(n)+h(n), widely used in maps and game AI.
6mo ago
Algorithms advanced
Disjoint Set / Union-Find
A data structure tracking which elements belong to the same group — supporting near-O(1) union and find operations. Used for network connectivity, Kruskal's MST, and cycle detection.
6mo ago
Data Structures advanced
Graph Algorithms
PHP 5.0+
2
Algorithms for traversing, searching, and finding paths in graphs — BFS for shortest hops, DFS for exploration, Dijkstra for weighted shortest paths.
6mo ago
Algorithms advanced