Struct MixedGraph 

pub struct MixedGraph { /* private fields */ }

A graph with both directed arcs and undirected edges.

Arcs are ordered pairs (u, v). Undirected edges preserve the input order so higher-level models can use that order as part of their configuration semantics, but edge-membership queries treat them as unordered pairs.

Implementations

impl MixedGraph

pub fn new( num_vertices: usize, arcs: Vec<(usize, usize)>, edges: Vec<(usize, usize)>, ) -> Self

Create a new mixed graph.

Panics

Panics if any endpoint references a vertex outside 0..num_vertices.

pub fn empty(num_vertices: usize) -> Self

Create an empty mixed graph with no arcs or undirected edges.

pub fn num_vertices(&self) -> usize

Return the number of vertices.

pub fn num_arcs(&self) -> usize

Return the number of directed arcs.

pub fn num_edges(&self) -> usize

Return the number of undirected edges.

pub fn arcs(&self) -> Vec<(usize, usize)>

Return the directed arcs.

pub fn edges(&self) -> Vec<(usize, usize)>

Return the undirected edges.

pub fn has_arc(&self, u: usize, v: usize) -> bool

Return true when the directed arc (u, v) is present.

pub fn has_edge(&self, u: usize, v: usize) -> bool

Return true when the undirected edge {u, v} is present.

pub fn out_degree(&self, v: usize) -> usize

Return the outgoing arc count of vertex v.

pub fn in_degree(&self, v: usize) -> usize

Return the incoming arc count of vertex v.

pub fn undirected_degree(&self, v: usize) -> usize

Return the undirected-edge count incident to vertex v.

pub fn is_empty(&self) -> bool

Return true if the graph has no vertices.

Trait Implementations

impl Clone for MixedGraph

fn clone(&self) -> MixedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MixedGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for MixedGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for MixedGraph

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl VariantParam for MixedGraph

const CATEGORY: &'static str = "graph"

Category name (e.g., "graph", "weight", "k").

const VALUE: &'static str = "MixedGraph"

Type name within the category (e.g., "SimpleGraph", "i32").

const PARENT_VALUE: Option<&'static str> = None

Parent type name in the subtype hierarchy, or None for root types.

impl Eq for MixedGraph