Struct BipartiteGraph 

pub struct BipartiteGraph { /* private fields */ }

Bipartite graph with explicit left/right partitions.

Vertices are split into left (indices 0..left_size) and right (0..right_size). Edges connect left vertices to right vertices using bipartite-local coordinates. The Graph trait maps to a unified vertex space where right vertices are offset by left_size.

Example

use problemreductions::topology::{BipartiteGraph, Graph};

// K_{2,2}: complete bipartite graph
let g = BipartiteGraph::new(2, 2, vec![(0, 0), (0, 1), (1, 0), (1, 1)]);
assert_eq!(g.num_vertices(), 4);
assert_eq!(g.num_edges(), 4);
assert!(g.has_edge(0, 2)); // left 0 -> right 0 (unified index 2)

Implementations

impl BipartiteGraph

pub fn new( left_size: usize, right_size: usize, edges: Vec<(usize, usize)>, ) -> Self

Create a new bipartite graph.

Arguments

• left_size - Number of vertices in the left partition
• right_size - Number of vertices in the right partition
• edges - Edges as (left_index, right_index) pairs in bipartite-local coordinates

Panics

Panics if any edge references an out-of-bounds left or right vertex index.

pub fn left_size(&self) -> usize

Returns the number of vertices in the left partition.

pub fn right_size(&self) -> usize

Returns the number of vertices in the right partition.

pub fn left_edges(&self) -> &[(usize, usize)]

Returns the edges in bipartite-local coordinates.

Trait Implementations

impl CastToParent for BipartiteGraph

type Parent = SimpleGraph

The parent type.

fn cast_to_parent(&self) -> SimpleGraph

Convert this value to its parent type.

impl Clone for BipartiteGraph

fn clone(&self) -> BipartiteGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BipartiteGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BipartiteGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Graph for BipartiteGraph

const NAME: &'static str = "BipartiteGraph"

The name of the graph type (e.g., “SimpleGraph”, “KingsSubgraph”).

fn num_vertices(&self) -> usize

Returns the number of vertices in the graph.

fn num_edges(&self) -> usize

Returns the number of edges in the graph.

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

Returns all edges as a list of (u, v) pairs.

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

Checks if an edge exists between vertices u and v.

fn neighbors(&self, v: usize) -> Vec<usize>

Returns all neighbors of vertex v.

fn degree(&self, v: usize) -> usize

Returns the degree of vertex v (number of neighbors).

fn is_empty(&self) -> bool

Returns true if the graph has no vertices.

fn for_each_edge<F>(&self, f: F)

where F: FnMut(usize, usize),

Iterates over all edges, calling a closure for each.

impl PartialEq for BipartiteGraph

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

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 BipartiteGraph

const CATEGORY: &'static str = "graph"

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

const VALUE: &'static str = "BipartiteGraph"

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

const PARENT_VALUE: Option<&'static str>

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

impl StructuralPartialEq for BipartiteGraph