PathFinder is an interactive, web-based visualizer for Dijkstra's Shortest Path Algorithm. It allows users to build custom graph networks by adding nodes and edges, and watch in real-time as the ...

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 ...

A browser-based simulator for the Computer Networks course. It models a network of 8 routers, computes shortest paths with Dijkstra (link-state) and Bellman-Ford (distance-vector), and adds a ...