In mathematics and computer science, a directed acyclic graph, is a finite directed graph with no directed cycles. It consists of finitely many vertices and edges, with each edge directed from one ...

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