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 192 193 194 195 196 197 198 199 200 201 202 203 204 205
// Copyright (c) 2015, 2016, 2017 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/> // //! A library for basic graph data structures and algorithms. /// Create a node vector associated with a graph. /// /// # Example /// /// Create a vector with all elements set to some value, use `nodevec![g; x]` /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights = nodevec![&g; 0]; /// assert!(g.nodes().all(|u| weights[u] == 0)); /// # } /// ``` /// /// Convert an existing vector to a `NodeVec`, use `nodevec![g, v]`. /// Note that the size of `v` must be exactly `g.num_nodes()`. /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, IndexGraph, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights: Vec<_> = (0..g.num_nodes()).collect(); /// let weights = nodevec![&g, weights]; /// assert!(g.nodes().all(|u| weights[u] == g.node_id(u))); /// # } /// ``` #[macro_export] macro_rules! nodevec { ( $ g : expr ; $ elem : expr ) => { $crate::vec::NodeVec::from_vec($g, vec![$elem; $g.num_nodes()]) }; ( $ g : expr , $ vec : expr ) => { $crate::vec::NodeVec::from_vec($g, $vec) }; } /// Create an edge vector associated with a graph. /// /// # Example /// /// Create a vector with all elements set to some value, use `edgevec![g; x]` /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights = edgevec![&g; 0]; /// assert!(g.edges().all(|e| weights[e] == 0)); /// # } /// ``` /// /// Convert an existing vector to an `EdgeVec`, use `edgevec![g, v]`. /// Note that the size of `v` must be exactly `g.num_edges()`. /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, IndexGraph, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights: Vec<_> = (0..g.num_edges()).collect(); /// let weights = edgevec![&g, weights]; /// assert!(g.edges().all(|e| weights[e] == g.edge_id(e))); /// # } /// ``` #[macro_export] macro_rules! edgevec { ( $ g : expr ; $ elem : expr ) => { $crate::vec::EdgeVec::from_vec($g, vec![$elem; $g.num_edges()]) }; ( $ g : expr , $ vec : expr ) => { $crate::vec::EdgeVec::from_vec($g, $vec) }; } /// Create a biedge vector associated with a network. /// /// # Example /// /// Create a vector with all elements set to some value, use `biedgevec![g; x]` /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, Network, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights = biedgevec![&g; 0]; /// assert!(g.edges().all(|e| weights[e] == 0 && weights[g.reverse(e)] == 0)); /// # } /// ``` /// /// Convert an existing vector to a `BiEdgeVec`, use `biedgevec![g, v]`. /// Note that the size of `v` must be exactly `g.num_edges() * 2`. /// /// ``` /// # #[macro_use] /// # extern crate graph; /// # use graph::{Graph, IndexGraph, Network, IndexNetwork, LinkedListGraph}; /// # use graph::classes::peterson; /// # /// # fn main() { /// let g = peterson::<LinkedListGraph>(); /// let weights: Vec<_> = (0..g.num_edges() * 2).collect(); /// let weights = biedgevec![&g, weights]; /// assert!(g.edges().all(|e| { /// let f = g.reverse(e); /// weights[e] == g.biedge_id(e) && weights[f] == g.biedge_id(f) /// })); /// # } /// ``` #[macro_export] macro_rules! biedgevec { ( $ g : expr ; $ elem : expr ) => { $crate::vec::BiEdgeVec::from_vec($g, vec![$elem; $g.num_edges() * 2]) }; ( $ g : expr , $ vec : expr ) => { $crate::vec::BiEdgeVec::from_vec($g, $vec) }; } mod num { pub extern crate num_traits as traits; pub extern crate num_iter as iter; } #[cfg(feature="quick-error")] #[macro_use] extern crate quick_error; #[cfg(feature="serialize")] extern crate serde; #[cfg(feature="serialize")] #[macro_use] extern crate serde_derive; // # Data structures pub mod graph; pub use self::graph::{Node, Edge, Graph, Digraph, Network, IndexGraph, IndexNetwork}; pub mod builder; pub use builder::Builder; pub mod attributed; pub use self::attributed::{Attributes, NetworkAttributes, Attributed, AttributedGraph, AttributedNetwork, AttributedBuilder}; pub mod wrapped; pub use self::wrapped::{WrappedGraph, WrappedGraphMut, WrappedBuilder}; pub mod linkedlistgraph; pub use self::linkedlistgraph::LinkedListGraph; /// 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 self::vec::{NodeSlice, NodeSliceMut, NodeVec}; pub use self::vec::{EdgeSlice, EdgeSliceMut, EdgeVec}; pub use self::vec::{BiEdgeSlice, BiEdgeSliceMut, BiEdgeVec}; // # Algorithms pub mod algorithms; pub mod branching; pub mod maxflow; pub mod mst; pub mod shortestpath; // # Drawing pub mod draw; #[cfg(any(feature="dimacs"))] pub mod dimacs; #[cfg(any(feature="steinlib"))] pub mod steinlib;