[erlang-questions] graphs and trees

Richard Carlsson <>
Thu Dec 20 13:14:15 CET 2007


French, Mike wrote:
> No, because is_acyclic(G) considers the direction of edges,
> and a pair of nodes can be connected by multiple paths that do not form a
> cycle.
> What you have found is a Directed Acyclic Graph (DAG).

Duh. Sorry, I got ahead of myself looking for a quick solution
using the existing libraries.

    /Richard





More information about the erlang-questions mailing list