rs-graph 0.20.1

A library for graph algorithms and combinatorial optimization
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143

/*
 * Copyright (c) 2021 Frank Fischer <frank-fischer@shadow-soft.de>
 *
 * This program is free software: you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see  <http://www.gnu.org/licenses/>
 */

struct PtrNode {}

struct PtrEdge {}

struct PtrGraph {
    nodes: Vec<PtrNode>,
    edges: Vec<PtrNode>,
}

impl<'a> PartialEq for &'a PtrNode {
    fn eq(&self, other: &Self) -> bool {
        *self as *const PtrNode == *other as *const PtrNode
    }
}

impl<'a> Eq for &'a PtrNode {}

impl<'a> PartialEq for &'a PtrEdge {
    fn eq(&self, other: &Self) -> bool {
        *self as *const PtrEdge == *other as *const PtrEdge
    }
}

impl<'a> Eq for &'a PtrEdge {}

impl<'a> GraphType<'a> for PtrGraph {
    type Node = &'a PtrNode;
    type Edge = &'a PtrEdge;
}

struct PtrIt<'a, T>(std::slice::Iter<'a, T>);

impl<'a, T> Clone for PtrIt<'a, T> {
    fn clone(&self) -> Self {
        PtrIt(self.0.clone())
    }
}

impl<'a, T> GraphIterator<PtrGraph> for PtrIt<'a, T> {
    type Item = &'a T;

    fn next(&mut self, g: &PtrGraph) -> Option<Self::Item> {
        todo!()
    }
}

impl<'a> GraphSize<'a> for PtrGraph {
    type NodeIt = PtrIt<'a, PtrNode>;

    type EdgeIt = PtrIt<'a, PtrEdge>;

    fn num_nodes(&self) -> usize {
        self.nodes.len()
    }

    fn num_edges(&self) -> usize {
        todo!()
    }

    fn nodes_iter(&'a self) -> Self::NodeIt {
        todo!()
    }

    fn edges_iter(&'a self) -> Self::EdgeIt {
        todo!()
    }
}

#[derive(Clone)]
struct PtrNeighIt<'a>(std::marker::PhantomData<&'a usize>);

impl<'a> GraphIterator<PtrGraph> for PtrNeighIt<'a> {
    type Item = (&'a PtrEdge, &'a PtrNode);

    fn next(&mut self, g: &PtrGraph) -> Option<Self::Item> {
        todo!()
    }
}

impl<'a> Undirected<'a> for PtrGraph {
    type NeighIt = PtrNeighIt<'a>;

    fn enodes(&'a self, e: Self::Edge) -> (Self::Node, Self::Node) {
        todo!()
    }

    fn neigh_iter(&'a self, u: Self::Node) -> Self::NeighIt {
        todo!()
    }
}

impl<'a> IndexGraph<'a> for PtrGraph {
    fn node_id(&self, u: Self::Node) -> usize {
        todo!()
    }

    fn id2node<'s>(&'s self, id: usize) -> Self::Node
    where
        'a: 's,
    {
        let u: &'s PtrNode = &self.nodes[id];
        u
    }

    fn edge_id(&self, e: Self::Edge) -> usize {
        todo!()
    }

    fn id2edge(&self, id: usize) -> Self::Edge {
        todo!()
    }
}

impl PtrGraph {
    fn new() -> Self {
        todo!()
    }
}

fn test() {
    let g = PtrGraph::new();
    for i in 0..g.num_nodes() {
        let u = g.id2node(i);
        assert_eq!(i, g.node_id(u));
    }
}