# Graph - Acyclic

Acyclic means that any two vertices (node) are connected by exactly one path.

There is no cycle

Discover More
(Network|Graph) - Directed acyclic graph (DAG)

A directed acyclic graph (DAG), is a finite directed graph with no directed cycles. Unlike a tree data structure, a directed acyclic graph can have diamond-shaped edge/branch that rejoin. For example,...
(Tree|Nested Set|Hierarchy) Data Structure

A tree is a node that may have children. Tree's are inherently recursive by definition as each child of a node is a Tree itself, with or without children nodes. A tree is a special case of a graph structure...
Graph (Network - Nodes and edges)

A graph is a set of vertices connected by edges. See Data representation that naturally captures complex relationships is a graph (or network). Except of the special graph that a tree is, the data...
Graph - Cycle

A path that starts from a node and can come back to the same node is called a cycle A graph without a cycle is called acyclic.
Graph - Path

A path is a sequence of edges. How to get from a node A to a node B. If two nodes are connected only by one path, there is no cycle A sequence of edges is called a path. Main Quad-to-Gregorian...