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
use alloc::collections::BTreeSet;
pub trait Vertices<T>
where
T: Ord,
{
fn vertices(&self) -> BTreeSet<&T>;
}
pub trait Edges<T>
where
T: Ord,
{
fn edges(&self) -> BTreeSet<&T>;
}
pub trait AddVertex<V, E>
where
E: Ord,
{
fn add_vertex(&mut self, x: V) -> Option<BTreeSet<E>>;
}
pub trait AddEdge<V, E> {
type Error;
fn add_edge(&mut self, x: V, y: V, e: E) -> Result<Option<(V, V)>, Self::Error>;
}
pub trait GetEdgeValue<V, E> {
fn get_edge_value(&self, x: E) -> Option<&(V, V)>;
}
pub trait GetVertexValue<V, E>
where
E: Ord,
{
fn get_vertex_value(&self, x: V) -> Option<&BTreeSet<E>>;
}
pub trait RemoveEdge<V, E> {
fn remove_edge(&mut self, x: E) -> Option<(V, V)>;
}
pub trait RemoveVertex<V, E>
where
E: Ord,
{
fn remove_vertex(&mut self, x: V) -> Option<BTreeSet<E>>;
}
pub trait Adjacent<T> {
type Error;
fn adjacent(&self, x: T, y: T) -> Result<bool, Self::Error>;
}
pub trait Connections<T> {
type Error;
fn connections(&self, x: T) -> Result<BTreeSet<&T>, Self::Error>;
}