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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
#![doc(html_root_url = "https://docs.rs/petgraph/0.3/")]
extern crate fixedbitset;
extern crate itertools;
#[doc(no_inline)]
pub use graph::Graph;
pub use graphmap::GraphMap;
#[cfg(feature = "stable_graph")]
#[doc(no_inline)]
pub use stable_graph::StableGraph;
pub use visit::{
Bfs,
BfsIter,
Dfs,
DfsIter,
};
pub use EdgeDirection::{Outgoing, Incoming};
mod scored;
pub mod algo;
#[cfg(feature = "generate")]
pub mod generate;
pub mod graphmap;
#[path = "graph.rs"]
mod graph_impl;
pub mod dot;
pub mod visit;
pub mod unionfind;
mod dijkstra;
mod isomorphism;
mod traits_graph;
#[cfg(feature = "quickcheck")]
mod quickcheck;
pub mod graph {
pub use graph_impl::{
Edge,
EdgeIndex,
EdgeIndices,
EdgeReference,
EdgeReferences,
EdgeWeightsMut,
Edges,
Externals,
Frozen,
Graph,
Neighbors,
Node,
NodeIndex,
NodeIndices,
NodeWeightsMut,
WalkNeighbors,
GraphIndex,
IndexType,
edge_index,
node_index,
DefaultIx,
};
}
#[cfg(feature = "stable_graph")]
pub use graph_impl::stable as stable_graph;
macro_rules! copyclone {
($name:ident) => {
impl Clone for $name {
#[inline]
fn clone(&self) -> Self { *self }
}
}
}
#[derive(Copy, Debug, PartialEq, PartialOrd, Ord, Eq, Hash)]
pub enum EdgeDirection {
Outgoing = 0,
Incoming = 1
}
copyclone!(EdgeDirection);
impl EdgeDirection {
#[inline]
pub fn opposite(&self) -> EdgeDirection {
match *self {
Outgoing => Incoming,
Incoming => Outgoing,
}
}
}
#[derive(Copy, Debug)]
pub enum Directed { }
copyclone!(Directed);
#[derive(Copy, Debug)]
pub enum Undirected { }
copyclone!(Undirected);
pub trait EdgeType {
fn is_directed() -> bool;
}
impl EdgeType for Directed {
#[inline]
fn is_directed() -> bool { true }
}
impl EdgeType for Undirected {
#[inline]
fn is_directed() -> bool { false }
}
pub trait IntoWeightedEdge<E> {
type NodeId;
fn into_weighted_edge(self) -> (Self::NodeId, Self::NodeId, E);
}
impl<Ix, E> IntoWeightedEdge<E> for (Ix, Ix)
where E: Default
{
type NodeId = Ix;
fn into_weighted_edge(self) -> (Ix, Ix, E) {
let (s, t) = self;
(s, t, E::default())
}
}
impl<Ix, E> IntoWeightedEdge<E> for (Ix, Ix, E)
{
type NodeId = Ix;
fn into_weighted_edge(self) -> (Ix, Ix, E) {
self
}
}
impl<'a, Ix, E> IntoWeightedEdge<E> for (Ix, Ix, &'a E)
where E: Clone
{
type NodeId = Ix;
fn into_weighted_edge(self) -> (Ix, Ix, E) {
let (a, b, c) = self;
(a, b, c.clone())
}
}
impl<'a, Ix, E> IntoWeightedEdge<E> for &'a (Ix, Ix)
where Ix: Copy, E: Default
{
type NodeId = Ix;
fn into_weighted_edge(self) -> (Ix, Ix, E) {
let (s, t) = *self;
(s, t, E::default())
}
}
impl<'a, Ix, E> IntoWeightedEdge<E> for &'a (Ix, Ix, E)
where Ix: Copy, E: Clone
{
type NodeId = Ix;
fn into_weighted_edge(self) -> (Ix, Ix, E) {
self.clone()
}
}