Directed acyclic graph, a directed graph without any directed cycles
Forest (graph theory), an undirected acyclic graph
Polytree, a directed graph without any undirected cycles
Topics referred to by the same term
This disambiguation page lists mathematics articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article.
In mathematics, particularly graph theory, and computer science, a directed acyclicgraph (DAG) is a directed graph with no directed cycles. That is, it...
Acyclicgraph may refer to: Directed acyclicgraph, a directed graph without any directed cycles Forest (graph theory), an undirected acyclicgraph Polytree...
computer science, a deterministic acyclic finite state automaton (DAFSA), also called a directed acyclic word graph (DAWG; though that name also refers...
of a graph is the maximum number of colors in a complete coloring. acyclic 1. A graph is acyclic if it has no cycles. An undirected acyclicgraph is the...
of the incidence graph. We can define a weaker notion of hypergraph acyclicity, later termed α-acyclicity. This notion of acyclicity is equivalent to...
acyclic aliphatic compounds In mathematics: A graph without a cycle, especially A directed acyclicgraph An acyclic complex is a chain complex all of whose...
as possible among all graphs with that property. The transitive reduction of a finite directed acyclicgraph (a directed graph without directed cycles)...
Directed acyclic word graph (DAWG) may refer to two related, but distinct, automata constructions in computer science: Deterministic acyclic finite state...
In graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2-chromatic subgraph is acyclic. The acyclic chromatic number A(G) of...
construction of a layered graph drawing proceeds in a sequence of steps: If the input graph is not already a directed acyclicgraph, a set of edges is identified...
digraph. A directed graph is acyclic if it has no directed cycles. The usual name for such a digraph is directed acyclicgraph (DAG). Multitrees are DAGs...
In graph theory, an acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any directed...
every cycle in the graph. Removing these edges from the graph breaks all of the cycles, producing an acyclic subgraph of the given graph, often called a...
A propositional directed acyclicgraph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented...
a single vertex, the resulting graph is a directed acyclicgraph, the condensation of G. A directed graph is acyclic if and only if it has no strongly...
to approximate. However, it has a linear time solution for directed acyclicgraphs, which has important applications in finding the critical path in scheduling...
be evaluated first. If a dependency graph does not have any circular dependencies, it forms a directed acyclicgraph, and an evaluation order may be found...
specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclicgraph whose underlying...
called least common ancestor) of two nodes v and w in a tree or directed acyclicgraph (DAG) T is the lowest (i.e. deepest) node that has both v and w as descendants...
In graph theory, a moral graph is used to find the equivalent undirected form of a directed acyclicgraph. It is a key step of the junction tree algorithm...
The acyclic dependencies principle (ADP) is a software design principle defined by Robert C. Martin that states that "the dependency graph of packages...
Global Information