View Source Dependents.Tree.Digraph (Dependents Tree v0.1.26)

In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by an arrow extending from one vertex to another.

Here vertices are apps and edges are arrows extending from an app to its dependents.

Link to this section Summary

Types

t()

Erlang digraph

Functions

Returns a recursive list of the out-neighbors of app.

Converts a Dependents.Tree into a digraph.

Assigns each app (vertex) to its topological rank in digraph.

Link to this section Types

Specs

t() :: :digraph.graph()

Erlang digraph

Link to this section Functions

Link to this function

dependents(digraph, app)

View Source

Specs

dependents(t(), Dependents.Tree.app()) :: [Dependents.Tree.dep()]

Returns a recursive list of the out-neighbors of app.

If an edge is emanating from v and incident on w, then w is said to be an out-neighbor of v, and v is said to be an in-neighbor of w.

Specs

from_tree(Dependents.Tree.t()) :: t()

Converts a Dependents.Tree into a digraph.

Specs

ranks(t()) :: Dependents.Tree.ranks()

Assigns each app (vertex) to its topological rank in digraph.