pub struct DAG { /* private fields */ }
Expand description

The Ranked-DAG data structure.

Implementations

Remove an edge from \p from to \p to. \returns True if an edge was removed.

Create a new node.

Create \p n new nodes.

\returns True if there is a path from \p ‘from’ to \p ‘to’.

\returns the number of ranks in the dag.

\return a mutable reference to a row at level \p level.

\return a reference to a row at level \p level.

\return a reference to the whole rank data structure.

\return a mutable reference to the whole rank data structure.

\returns True if \p elem is the first node in the row \p level.

\returns True if \p elem is the last node in the row \p level.

Places all of the nodes in ranks (levels).

Move the node \p node to a new level \p new_level. Place the node before \p node, or at the end.

\returns the level of the node \p node in the rank.

Trait Implementations

Returns the “default value” for a type. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.