Definitions for

**"Dependency graph"**A dependency graph is a forest of rooted binary trees whose roots are the vertices of the coarse mesh, , and whose leaves are the vertices of the original mesh . The following figures show an example. has vertex 1, 2, 3, 4, and 5, which are the roots of the corresponding dependency graph. has vertex 1, 8, 9, 6, 7, 4, and 5, which are the leaves of the dependency graph.

A graphical representation of the relationships between connected nodes, viewable from the Hypergraph window. For any particular node, the dependency graph shows the node's history, including all connected nodes and their connected nodes. For example, a dependency graph could show connections between shading group elements that create an object's material appearance. Unlike the DAG, these relationships can be cyclic, and do not represent a parenting relationship. Instead, the connections in the graph allow data to move from one entity in the graph to another. The entities in the graph which accept and output data are called dependency graph nodes. Also known as DG. Contrast with DAG. See also Hypergraph.

an acyclic directed graph (one containing no cycles) of dependencies