Struct BipartiteGraph 

pub struct BipartiteGraph<N: Node, E: EdgeWeight, Ix: IndexType = u32> { /* private fields */ }

A specialized bipartite graph structure

A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent. This implementation enforces the bipartite property and provides optimized operations.

Implementations

impl<N: Node + Debug, E: EdgeWeight, Ix: IndexType> BipartiteGraph<N, E, Ix>

pub fn new() -> Self

Create a new empty bipartite graph

pub fn from_graph(graph: Graph<N, E, Ix>) -> Result<Self>

where N: Clone, E: Clone,

Create a bipartite graph from a regular graph if it’s bipartite

Arguments

• graph - The input graph to convert

Returns

• Result<BipartiteGraph<N, E, Ix>> - The bipartite graph if conversion is successful

pub fn add_node_to_set_a(&mut self, node: N)

Add a node to set A of the bipartition

pub fn add_node_to_set_b(&mut self, node: N)

Add a node to set B of the bipartition

pub fn add_edge(&mut self, source: N, target: N, weight: E) -> Result<()>

where N: Clone,

Add an edge between nodes from different sets

Arguments

• source - Source node (must be in one set)
• target - Target node (must be in the other set)
• weight - Edge weight

Returns

• Result<()> - Success or error if nodes are in the same set

pub fn set_a(&self) -> &HashSet<N>

Get all nodes in set A

pub fn set_b(&self) -> &HashSet<N>

Get all nodes in set B

pub fn set_a_size(&self) -> usize

Get the size of set A

pub fn set_b_size(&self) -> usize

Get the size of set B

pub fn node_set(&self, node: &N) -> Option<u8>

Check which set a node belongs to

Arguments

• node - The node to check

Returns

• Some(0) if node is in set A, Some(1) if in set B, None if not found

pub fn neighbors(&self, node: &N) -> Result<Vec<N>>

where N: Clone,

Get neighbors of a node (always from the opposite set)

pub fn neighbors_in_a(&self, node: &N) -> Result<Vec<N>>

where N: Clone,

Get neighbors in set A for a node in set B

pub fn neighbors_in_b(&self, node: &N) -> Result<Vec<N>>

where N: Clone,

Get neighbors in set B for a node in set A

pub fn degree(&self, node: &N) -> usize

Get the degree of a node

pub fn nodes(&self) -> Vec<&N>

Get all nodes in the graph

pub fn edges(&self) -> Vec<Edge<N, E>>

where N: Clone, E: Clone,

Get all edges in the graph

pub fn node_count(&self) -> usize

Number of nodes in the graph

pub fn edge_count(&self) -> usize

Number of edges in the graph

pub fn has_node(&self, node: &N) -> bool

Check if the graph has a node

pub fn has_edge(&self, source: &N, target: &N) -> bool

Check if an edge exists between two nodes

pub fn edge_weight(&self, source: &N, target: &N) -> Result<E>

where E: Clone,

Get the weight of an edge between two nodes

pub fn biadjacency_matrix(&self) -> Array2<E>

where E: Zero + Copy, N: Clone,

Get the adjacency matrix representation of the bipartite graph

Returns a matrix where rows correspond to set A and columns to set B

pub fn to_graph(self) -> Graph<N, E, Ix>

Convert to a regular graph

pub fn as_graph(&self) -> &Graph<N, E, Ix>

Get a reference to the underlying graph

pub fn is_complete(&self) -> bool

Check if the graph is complete bipartite (all possible edges exist)

pub fn max_edges(&self) -> usize

Get the maximum possible number of edges for this bipartite graph

pub fn density(&self) -> f64

Get the density of the bipartite graph (actual edges / max possible edges)

Trait Implementations

impl<N: Node + Debug, E: EdgeWeight, Ix: IndexType> Default for BipartiteGraph<N, E, Ix>

fn default() -> Self

Returns the “default value” for a type.