Struct gamma::graph::DefaultGraph

pub struct DefaultGraph { /* fields omitted */ }

An undirected Graph backed by an adjacency matrix. Nodes and neighbors are iterated in the order in which they're added.

use std::convert::TryFrom;
use gamma::graph::{ Graph, Error, DefaultGraph };
 
fn main() -> Result<(), Error> {
    let mut c3 = DefaultGraph::try_from(vec![
        vec![ 1 ],
        vec![ 0, 2 ],
        vec![ 1 ]
    ])?;
 
    assert_eq!(c3.ids().collect::<Vec<_>>(), vec![ 0, 1, 2 ]);
 
    assert_eq!(c3.add_edge(0, 1), Err(Error::DuplicateEdge(0, 1)));
 
    Ok(())
}

Implementations

impl DefaultGraph

pub fn new() -> Self

pub fn add_node(&mut self, id: usize) -> Result<(), Error>

pub fn add_edge(&mut self, sid: usize, tid: usize) -> Result<(), Error>

Trait Implementations

impl Debug for DefaultGraph

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

Formats the value using the given formatter.

impl Graph for DefaultGraph

fn is_empty(&self) -> bool

Returns true if there are no nodes, or false otherwise.

fn order(&self) -> usize

Returns the number of nodes in this graph.

fn size(&self) -> usize

Returns the number of edges in this graph.

fn ids(&self) -> Box<dyn Iterator<Item = usize>>

Returns an Iterator over node identifiers.

fn neighbors(&self, id: usize) -> Result<Box<dyn Iterator<Item = usize>>, Error>

Returns an iterator over node identifiers for the neighbors at id, or Error if not found.

fn has_id(&self, id: usize) -> bool

Returns true if id is a member, or false otherwise.

fn degree(&self, id: usize) -> Result<usize, Error>

Returns the count of neighbors at id, or Error if id not found.

fn edges(&self) -> Box<dyn Iterator<Item = (usize, usize)>>

Returns an iterator over the edges of this graph.

fn has_edge(&self, sid: usize, tid: usize) -> Result<bool, Error>

Returns true if the edge (sid, tid) exists, or false otherwise. Returns Error if either sid or tid are not found.

impl PartialEq<DefaultGraph> for DefaultGraph

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<'a, G: Graph> TryFrom<DepthFirst<'a, G>> for DefaultGraph

type Error = Error

The type returned in the event of a conversion error.

fn try_from(traversal: DepthFirst<'a, G>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Vec<(usize, usize), Global>> for DefaultGraph

type Error = Error

The type returned in the event of a conversion error.

fn try_from(edges: Vec<(usize, usize)>) -> Result<Self, Self::Error>

Performs the conversion.

impl TryFrom<Vec<Vec<usize, Global>, Global>> for DefaultGraph

type Error = Error

The type returned in the event of a conversion error.

fn try_from(adjacency: Vec<Vec<usize>>) -> Result<Self, Self::Error>

Performs the conversion.