Struct Graph 

pub struct Graph { /* private fields */ }

Undirected, unweighted graph backed by an adjacency list.

Implementations

impl Graph

pub fn with_vertices(n: u32) -> Self

Construct an empty graph on n vertices and no edges.

pub fn vcount(&self) -> u32

Number of vertices. Counterpart of igraph_vcount().

pub fn ecount(&self) -> usize

Number of edges. Counterpart of igraph_ecount().

pub fn add_vertices(&mut self, count: u32) -> (VertexId, VertexId)

Append count new isolated vertices, returning the id range (first, last_inclusive) of the new vertices.

pub fn add_edge(&mut self, u: VertexId, v: VertexId) -> IgraphResult<()>

Add a single undirected edge between u and v.

Self-loops are allowed (added once); parallel edges are allowed.

pub fn add_edges<I>(&mut self, edges: I) -> IgraphResult<()>

where I: IntoIterator<Item = (VertexId, VertexId)>,

Add a sequence of undirected edges.

pub fn neighbors(&self, v: VertexId) -> IgraphResult<&[VertexId]>

Neighbors of v. Order is insertion order.

pub fn degree(&self, v: VertexId) -> IgraphResult<usize>

Degree of v (counting self-loops once each, parallel edges separately).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.