igraph (version 1.2.4.1)

is_dag: Directed acyclic graphs

Description

This function tests whether the given graph is a DAG, a directed acyclic graph.

Usage

is_dag(graph)

Arguments

graph

The input graph. It may be undirected, in which case FALSE is reported.

Value

A logical vector of length one.

Details

is_dag checks whether there is a directed cycle in the graph. If not, the graph is a DAG.

Examples

# NOT RUN {
g <- make_tree(10)
is_dag(g)
g2 <- g + edge(5,1)
is_dag(g2)
# }