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>) -> Result<Set<usize>>

Returns the parents of a set of vertices.

Arguments

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

Errors

• If any vertex is out of bounds.

Returns

The parents of the vertices.

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

Returns the ancestors of a set of vertices.

Arguments

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

Errors

• If any vertex is out of bounds.

Returns

The ancestors of the vertices.

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

Returns the children of a set of vertices.

Arguments

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

Errors

• If any vertex is out of bounds.

Returns

The children of the vertices.

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

Returns the descendants of a set of vertices.

Arguments

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

Errors

• 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>, ) -> Result<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>>, ) -> Result<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>>, ) -> Result<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 DotIO for DiGraph

fn from_dot_string(dot: &str) -> Result<Self>

Create an instance of the type from a DOT string.

fn to_dot_string(&self) -> Result<String>

Convert the instance to a DOT string.

fn from_dot_file(path: &str) -> Result<Self>

Read a DOT file and create an instance of the type.

fn to_dot_file(&self, path: &str) -> Result<()>

Write the instance to a DOT file.

impl Eq for DiGraph

impl From<&DiGraph> for DOT

Convert a directed graph into the graph-agnostic DOT representation.

fn from(graph: &DiGraph) -> Self

Converts to this type from the input type.

impl From<&DiGraph> for GML

Convert a directed graph into the graph-agnostic GML representation.

fn from(graph: &DiGraph) -> Self

Converts to this type from the input type.

impl GmlIO for DiGraph

fn from_gml_string(gml: &str) -> Result<Self>

Create an instance of the type from a GML string.

fn to_gml_string(&self) -> Result<String>

Convert the instance to a GML string.

fn from_gml_file(path: &str) -> Result<Self>

Read a GML file and create an instance of the type.

fn to_gml_file(&self, path: &str) -> Result<()>

Write the instance to a GML file.

impl Graph for DiGraph

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

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

Creates an empty graph with the given labels.

fn complete<I, V>(labels: I) -> Result<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 add_vertex<V>(&mut self, x: V) -> usize

where V: AsRef<str>,

Adds a new vertex with the given label to the graph.

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

Deletes the vertex at the given index from the graph, together with all its incident edges.

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

Returns the iterator of edges in the graph.

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

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

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

Adds an edge between vertices x and y.

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

Deletes the edge between vertices x and y.

fn select(&self, x: &Set<usize>) -> Result<Self>

where Self: Sized,

Restrict the graph to the specified variables.

fn from_adjacency_matrix( labels: Labels, adjacency_matrix: Array2<bool>, ) -> Result<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>, ) -> Result<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>>, ) -> Result<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>>, ) -> Result<Option<Set<usize>>>

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

impl HasLabels for DiGraph

fn labels(&self) -> &Labels

Returns the labels of the variables.

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

Return the variable index for a given label.

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

Return the label for a given variable index.

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

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

fn indices_to(&self, x: &Set<usize>, other: &Labels) -> Result<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) -> Result<usize>

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

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

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

impl JsonIO for DiGraph

fn from_json_reader<R: Read>(reader: R) -> Result<Self>

Create an instance of the type from a JSON reader.

fn to_json_writer<W: Write>(&self, writer: W) -> Result<()>

Write the instance to a JSON writer.

fn from_json_string(json: &str) -> Result<Self>

Create an instance of the type from a JSON string.

fn to_json_string(&self) -> Result<String>

Convert the instance to a JSON string.

fn from_json_file(path: &str) -> Result<Self>

Create an instance of the type from a JSON file.

fn to_json_file(&self, path: &str) -> Result<()>

Write the instance to a JSON file.

impl PartialEq for DiGraph

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

Equality operator ==.

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

Inequality operator !=.

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 StructuralPartialEq for DiGraph

impl TopologicalOrder for DiGraph

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

Returns the topological sort of the graph.

impl TryFrom<DOT> for DiGraph

Build a directed graph from the graph-agnostic DOT representation.

type Error = Error

The type returned in the event of a conversion error.

fn try_from(dot: DOT) -> Result<Self>

Performs the conversion.

impl TryFrom<GML> for DiGraph

Build a directed graph from the graph-agnostic GML representation.

type Error = Error

The type returned in the event of a conversion error.

fn try_from(gml: GML) -> Result<Self>

Performs the conversion.

impl VStructures for DiGraph

fn v_structures(&self) -> Result<Vec<(usize, usize, usize)>>

Returns the v-structures of the graph.