Struct rs_graph::linkedlistgraph::LinkedListGraphBuilder

pub struct LinkedListGraphBuilder<ID, N, E> { /* private fields */ }

A builder for a LinkedListGraph.

The basic task is to arrange the final outgoing and incoming edges in the linked lists appropriately (i.e. first outgoing, then incoming edges).

Trait Implementations

impl<ID, N, E> Builder for LinkedListGraphBuilder<ID, N, E>where ID: PrimInt + Unsigned + 'static, N: Default, E: Default,

type Graph = LinkedListGraph<ID, N, E>

The graph type produced by this builder.

type Node = Node<ID>

The type of a nodes.

type Edge = Edge<ID>

The type of an edge.

fn with_capacities(nnodes: usize, nedges: usize) -> Self

Create a new, empty builder.

fn reserve(&mut self, nnodes: usize, nedges: usize)

Reserve memory for a certain number of nodes and edges.

fn num_nodes(&self) -> usize

Return the current number of nodes.

fn num_edges(&self) -> usize

Return the current number of nodes.

fn add_node(&mut self) -> Self::Node

Add a new node.

fn add_edge(&mut self, u: Self::Node, v: Self::Node) -> Self::Edge

Add a new edge.

fn node2id(&self, u: Self::Node) -> usize

Return a unique id of a node.

fn edge2id(&self, e: Self::Edge) -> usize

Return a unique id of an edge.

fn id2node(&self, uid: usize) -> Self::Node

Return the node with a certain id.

fn id2edge(&self, eid: usize) -> Self::Edge

Return the edge with a certain id.

fn into_graph(self) -> LinkedListGraph<ID, N, E>

Turn the builder into a graph.

fn new() -> Self

Create a new, empty builder.

fn add_nodes(&mut self, n: usize) -> Vec<Self::Node>

Add n new nodes.