Struct DependencyGraph 

pub struct DependencyGraph {
    pub edges: IndexMap<PredicateId, Vec<PredicateId>>,
}

Fields

edges: IndexMap<PredicateId, Vec<PredicateId>>

Implementations

impl DependencyGraph

pub fn add_edge(&mut self, head: PredicateId, dependency: PredicateId)

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.

impl<'de> Deserialize<'de> for DependencyGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for DependencyGraph

fn eq(&self, other: &DependencyGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for DependencyGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for DependencyGraph

impl StructuralPartialEq for DependencyGraph