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

// Copyright (c) 2015-2020 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/>
//

#![forbid(unsafe_code)]

//! A library for basic graph data structures and algorithms.

mod num {
    pub use num_iter as iter;
    pub use num_traits as traits;
}

// # Data structures

pub mod traits;
pub use self::traits::{Digraph, Graph};
pub use self::traits::{IndexDigraph, IndexGraph};
pub use self::traits::{NumberedDigraph, NumberedGraph};

pub mod adapters;
pub use self::adapters::{reverse, Network, ReverseDigraph};

pub mod adjacencies;

pub mod filtered;

pub mod builder;
pub use crate::builder::{Buildable, Builder};

pub mod attributed;

pub mod linkedlistgraph;
pub use self::linkedlistgraph::LinkedListGraph;

pub mod attributes;
pub use self::attributes::{AttributedGraph, EdgeAttributes, NodeAttributes};

/// Graph classes
pub mod classes;

/// The default graph type.
///
/// A linked-list graph with up to 2^31 nodes and edges.
pub type Net = self::LinkedListGraph<u32>;

pub mod vec;
pub use crate::vec::{EdgeVec, NodeVec};

pub mod collections;

// # Algorithms

pub mod algorithms;
pub mod branching;
pub mod maxflow;
pub mod mst;
pub mod search;
pub mod shortestpath;

// # Drawing

pub mod draw;
pub mod string;

#[cfg(any(feature = "dimacs"))]
pub mod dimacs;
#[cfg(any(feature = "steinlib"))]
pub mod steinlib;