graph-types 0.0.13

Shared types for graph theory.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119

#![allow(unused_variables)]

use crate::{
    edges::typed_edges::IndeterminateEdge, errors::GraphError, Edge, EdgeID, EdgeInsertID, EdgeQuery, GraphEngine, GraphKind,
    MutableGraph, NodeID,
};

/// A placeholder graph engine.
#[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct PlaceholderGraph;
/// A placeholder node iterator.
#[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct PlaceholderNodeIterator<'a> {
    _phantom: std::marker::PhantomData<&'a PlaceholderGraph>,
}
/// A placeholder edge iterator.
#[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct PlaceholderEdgeIterator<'a> {
    _phantom: std::marker::PhantomData<&'a PlaceholderGraph>,
}

impl GraphEngine for PlaceholderGraph {
    type NeighborIterator<'a> = PlaceholderNodeIterator<'a>;

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

    /// A placeholder node iterator.
    type NodeTraverser<'a> = PlaceholderNodeIterator<'a>;
    type EdgeTraverser<'a> = PlaceholderNodeIterator<'a>;
    type BridgeTraverser<'a> = PlaceholderEdgeIterator<'a>;

    fn graph_kind(&self) -> GraphKind {
        unreachable!()
    }

    fn get_node(&self, node: NodeID) -> Result<NodeID, GraphError> {
        unreachable!()
    }

    fn all_nodes<'a>(&'a self) -> Self::NodeTraverser<'a> {
        unreachable!()
    }

    fn all_neighbors<'a>(&'a self, node: NodeID) -> Self::NeighborIterator<'a> {
        unreachable!()
    }

    fn get_edge(&self, edge: EdgeID) -> Result<EdgeID, GraphError> {
        unreachable!()
    }

    fn all_edges<'a>(&'a self) -> Self::EdgeTraverser<'a> {
        unreachable!()
    }

    fn get_bridge(&self, edge: EdgeID) -> Result<IndeterminateEdge, GraphError> {
        unreachable!()
    }

    fn get_bridges<'a>(&'a self, from: NodeID, goto: NodeID) -> Self::BridgeIterator<'a> {
        unreachable!()
    }

    fn all_bridges<'a>(&'a self) -> Self::BridgeTraverser<'a> {
        unreachable!()
    }
}

impl MutableGraph for PlaceholderGraph {
    fn insert_node(&mut self, node_id: usize) -> bool {
        unreachable!()
    }

    fn create_node(&mut self) -> usize {
        unreachable!()
    }

    fn remove_node_with_edges(&mut self, node_id: usize) {
        unreachable!()
    }

    fn insert_edge_with_nodes<E: Edge>(&mut self, edge: E) -> EdgeInsertID {
        unreachable!()
    }

    fn remove_edge<E>(&mut self, edge: E)
    where
        E: Into<EdgeQuery>,
    {
        unreachable!()
    }
}

impl<'a> Iterator for PlaceholderEdgeIterator<'a> {
    type Item = IndeterminateEdge;

    fn next(&mut self) -> Option<Self::Item> {
        unreachable!()
    }
}
impl<'a> DoubleEndedIterator for PlaceholderEdgeIterator<'a> {
    fn next_back(&mut self) -> Option<Self::Item> {
        unreachable!()
    }
}

impl<'a> Iterator for PlaceholderNodeIterator<'a> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        unreachable!()
    }
}

impl<'a> DoubleEndedIterator for PlaceholderNodeIterator<'a> {
    fn next_back(&mut self) -> Option<Self::Item> {
        unreachable!()
    }
}