Struct DiGraph 

pub struct DiGraph { /* private fields */ }

A struct representing a directed graph using an adjacency matrix.

Implementations

impl DiGraph

pub fn parents(&self, x: &Set<usize>) -> Set<usize>

Returns the parents of a set of vertices.

Arguments

• x - The set of vertices for which to find the parents.

Panics

• If any vertex is out of bounds.

Returns

The parents of the vertices.

pub fn ancestors(&self, x: &Set<usize>) -> Set<usize>

Returns the ancestors of a set of vertices.

Arguments

• x - The set of vertices for which to find the ancestors.

Panics

• If any vertex is out of bounds.

Returns

The ancestors of the vertices.

pub fn children(&self, x: &Set<usize>) -> Set<usize>

Returns the children of a set of vertices.

Arguments

• x - The set of vertices for which to find the children.

Panics

• If any vertex is out of bounds.

Returns

The children of the vertices.

pub fn descendants(&self, x: &Set<usize>) -> Set<usize>

Returns the descendants of a set of vertices.

Arguments

• x - The set of vertices for which to find the descendants.

Panics

• If any vertex is out of bounds.

Returns

The descendants of the vertices.

Trait Implementations

impl BackdoorCriterion for DiGraph

fn is_backdoor_set( &self, x: &Set<usize>, y: &Set<usize>, z: &Set<usize>, ) -> bool

Checks if the Z is a backdoor adjustment set for X and Y.

fn is_minimal_backdoor_set( &self, x: &Set<usize>, y: &Set<usize>, z: &Set<usize>, w: Option<&Set<usize>>, v: Option<&Set<usize>>, ) -> bool

Checks if the Z is a minimal backdoor adjustment set for X and Y.

fn find_minimal_backdoor_set( &self, x: &Set<usize>, y: &Set<usize>, w: Option<&Set<usize>>, v: Option<&Set<usize>>, ) -> Option<Set<usize>>

Finds a minimal backdoor adjustment set for the vertex sets X and Y, if any.

impl Clone for DiGraph

fn clone(&self) -> DiGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DiGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DiGraph

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Graph for DiGraph

fn empty<I, V>(labels: I) -> Self

where I: IntoIterator<Item = V>, V: AsRef<str>,

Creates an empty graph with the given labels.

fn complete<I, V>(labels: I) -> Self

where I: IntoIterator<Item = V>, V: AsRef<str>,

Creates a complete graph with the given labels.

fn vertices(&self) -> Set<usize>

Returns the iterator of vertices in the graph.

fn has_vertex(&self, x: usize) -> bool

Checks if a vertex exists in the graph.

fn edges(&self) -> Set<(usize, usize)>

Returns the iterator of edges in the graph.

fn has_edge(&self, x: usize, y: usize) -> bool

Checks if there is an edge between vertices x and y.

fn add_edge(&mut self, x: usize, y: usize) -> bool

Adds an edge between vertices x and y.

fn del_edge(&mut self, x: usize, y: usize) -> bool

Deletes the edge between vertices x and y.

fn from_adjacency_matrix(labels: Labels, adjacency_matrix: Array2<bool>) -> Self

Creates a graph from an adjacency matrix and labels.

fn to_adjacency_matrix(&self) -> Array2<bool>

Converts the graph to an adjacency matrix.

impl GraphicalSeparation for DiGraph

fn is_separator_set( &self, x: &Set<usize>, y: &Set<usize>, z: &Set<usize>, ) -> bool

Checks if the Z is a separator set for X and Y.

fn is_minimal_separator_set( &self, x: &Set<usize>, y: &Set<usize>, z: &Set<usize>, w: Option<&Set<usize>>, v: Option<&Set<usize>>, ) -> bool

Checks if the Z is a minimal separator set for X and Y.

fn find_minimal_separator_set( &self, x: &Set<usize>, y: &Set<usize>, w: Option<&Set<usize>>, v: Option<&Set<usize>>, ) -> Option<Set<usize>>

Finds a minimal separator set for the vertex sets X and Y, if any.

impl JsonIO for DiGraph

fn from_json(json: &str) -> Self

Create an instance of the type from a JSON string.

fn to_json(&self) -> String

Convert the instance to a JSON string.

fn read_json(path: &str) -> Self

Create an instance of the type from a JSON file.

fn write_json(&self, path: &str)

Write the instance to a JSON file.

impl Labelled for DiGraph

fn labels(&self) -> &Labels

Returns the labels of the variables.

fn label_to_index(&self, x: &str) -> usize

Return the variable index for a given label.

fn index_to_label(&self, x: usize) -> &str

Return the label for a given variable index.

fn index_to(&self, x: usize, other: &Labels) -> usize

Maps an index from this model to another model with the same label.

fn indices_to(&self, x: &Set<usize>, other: &Labels) -> Set<usize>

Maps a set of indices from this model to another model with the same labels.

fn index_from(&self, x: usize, other: &Labels) -> usize

Maps an index from another model to this model with the same label.

fn indices_from(&self, x: &Set<usize>, other: &Labels) -> Set<usize>

Maps a set of indices from another model to this model with the same labels.

impl PartialEq for DiGraph

fn eq(&self, other: &DiGraph) -> 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 DiGraph

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl TopologicalOrder for DiGraph

fn topological_order(&self) -> Option<Vec<usize>>

Returns the topological sort of the graph.

impl Eq for DiGraph

impl StructuralPartialEq for DiGraph