C++ implementations of various graph algorithms such as: Graph Traversals (BFS, DFS), Topological Sort, Shortest Path, and Minimum Spanning Trees. I wrote my own implementations of these graph ...

This is a web-based bus route optimization application developed as a project. The system is designed to help passengers and drivers identify the shortest and most efficient bus routes between two ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Abstract: This paper proposes an optimized Dijkstra algorithm for path planning in substation inspection robots. By modifying the data structure of unexpanded nodes to a priority queue and ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.