Struct PlaceholderGraph

pub struct PlaceholderGraph;

A placeholder graph engine.

Trait Implementations

impl Clone for PlaceholderGraph

fn clone(&self) -> PlaceholderGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PlaceholderGraph

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

Formats the value using the given formatter.

impl Default for PlaceholderGraph

fn default() -> PlaceholderGraph

Returns the “default value” for a type.

impl GraphEngine for PlaceholderGraph

type NodeTraverser<'a> = PlaceholderNodeIterator<'a>

A placeholder node iterator.

type NeighborIterator<'a> = PlaceholderNodeIterator<'a>

According to a given vertex, find all neighbor nodes. See more in Self::all_neighbors, Self::all_incoming, Self::all_outgoing.

type BridgeIterator<'a> = PlaceholderEdgeIterator<'a>

An iterator over the edges.

type EdgeTraverser<'a> = PlaceholderNodeIterator<'a>

An iterator over the edges.

type BridgeTraverser<'a> = PlaceholderEdgeIterator<'a>

An iterator over the edges.

fn graph_kind(&self) -> GraphKind

Check the graph kind, it can be directed or undirected.

fn get_node(&self, node: usize) -> Result<usize, GraphError>

Check if the node exists, return the node id if exists.

fn all_nodes<'a>( &'a self, ) -> <PlaceholderGraph as GraphEngine>::NodeTraverser<'a>

Traverse all nodes in the entire graph in the most friendly way to the data structure, and the order of this traversal is arbitrary.

fn all_neighbors<'a>( &'a self, node: usize, ) -> <PlaceholderGraph as GraphEngine>::NeighborIterator<'a>

Given a vertex, return all adjacent nodes.

fn get_edge(&self, edge: usize) -> Result<usize, GraphError>

Check if the edge exists, return the node id if exists.

fn all_edges<'a>( &'a self, ) -> <PlaceholderGraph as GraphEngine>::EdgeTraverser<'a>

Traverse all edges in the entire graph in the most friendly way to the data structure, the order of traversal is arbitrary.

fn get_bridge(&self, edge: usize) -> Result<IndeterminateEdge, GraphError>

fn get_bridges<'a>( &'a self, from: usize, goto: usize, ) -> <PlaceholderGraph as GraphEngine>::BridgeIterator<'a>

Give all edges matching the start and end points

fn all_bridges<'a>( &'a self, ) -> <PlaceholderGraph as GraphEngine>::BridgeTraverser<'a>

Get the edges of the graph.

fn count_nodes<'a>(&'a self) -> usize

Count the number of nodes in the graph.

fn all_outgoing<'a>(&'a self, node: usize) -> Self::NeighborIterator<'a>

Given a vertex as the starting point, return the ids corresponding to all ending points.

fn all_incoming<'a>(&'a self, node: usize) -> Self::NeighborIterator<'a>

Given a vertex as the ending point, return the ids corresponding to all starting points.

fn count_degree<'a>(&'a self, node: usize) -> NodeDegree

Check if the node exists, return the node id if exists.

fn count_edges<'a>(&'a self) -> usize

Count the number of edges in the graph.

fn size_hint(&self) -> usize

Query the total space occupied by the structure, return 0 if failed to query

impl Hash for PlaceholderGraph

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl MutableGraph for PlaceholderGraph

fn insert_node(&mut self, node_id: usize) -> bool

Insert a node without any neighbors (edges).

fn create_node(&mut self) -> usize

Insert a node without any neighbors (edges).

fn remove_node_with_edges(&mut self, node_id: usize)

Remove the given node and all edges connected to it.

fn insert_edge_with_nodes<E>(&mut self, edge: E) -> EdgeInsertID

where E: Edge,

Insert edge to graph, if the nodes does not exist, also insert them.

fn remove_edge<E>(&mut self, edge: E)

where E: Into<EdgeQuery>,

Remove edge by given edge-id or start and end node-id.

fn remove_node(&mut self, node_id: usize)

Remove the given node.

fn insert_edge<E>(&mut self, edge: E) -> EdgeInsertID

where E: Edge,

Insert a edge between two nodes.

fn shrink(&mut self)

Remove invalid edges and nodes to improve the efficiency of subsequent queries.

impl Ord for PlaceholderGraph

fn cmp(&self, other: &PlaceholderGraph) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for PlaceholderGraph

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

Tests for self and other values to be equal, and is used by ==.

const 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 PartialOrd for PlaceholderGraph

fn partial_cmp(&self, other: &PlaceholderGraph) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for PlaceholderGraph

impl Eq for PlaceholderGraph

impl StructuralPartialEq for PlaceholderGraph