Struct DependencyGraph 

pub struct DependencyGraph {
    pub def_uses: Vec<(String, Vec<String>)>,
    pub theorem_uses: Vec<String>,
}

The uses dependency graph among definitions and from a theorem to its definitions — the Rung 0b graph seed (each node a definition/theorem, each edge a uses). Direct edges only; transitive use is a query over this. This is the structure a mathscrapes node/edge compiles into.

Fields

def_uses: Vec<(String, Vec<String>)>

definiendum name → the defined names its definiens directly uses.

theorem_uses: Vec<String>

the defined names the theorem’s premises + goal directly use.

Trait Implementations

impl Clone for DependencyGraph

fn clone(&self) -> DependencyGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DependencyGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for DependencyGraph

fn default() -> DependencyGraph

Returns the “default value” for a type.