Acyclic S P Algorithm

However, there are many other kinds of directed acyclic graph that are not formed by orienting the edges of an undirected acyclic graph. In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG or dag (listen)) is a finite directed graph with no directed cycles.

Acyclic S P source code, pseudocode and analysis