- Links
-
petgraph/petgraph
2921 346 157 - crates.io
- Dependencies
- Versions
-
- 0.6.5
- 0.6.4
- 0.6.3
- 0.6.2
- 0.6.1
- 0.6.0
- 0.5.1
- 0.5.0
- 0.4.13
- 0.4.12
- 0.4.11
- 0.4.10
- 0.4.9
- 0.4.8
- 0.4.7
- 0.4.6
- 0.4.5
- 0.4.4
- 0.4.3
- 0.4.2
- 0.4.1
- 0.4.0
- 0.3.2
- 0.3.1
- 0.3.0
- 0.3.0-alpha.3
- 0.3.0-alpha.2
- 0.3.0-alpha.1
- 0.3.0-alpha.0
- 0.2.10
- 0.2.9
- 0.2.8
- 0.2.7
- 0.2.6
- 0.2.5
- 0.2.4
- 0.2.3
- 0.2.2
- 0.2.1
- 0.2.0
- 0.1.18
- 0.1.17
- 0.1.16
- 0.1.15
- 0.1.14
- 0.1.13
- 0.1.12
- 0.1.11
- 0.1.10
- 0.1.9
- 0.1.8
- 0.1.7
- 0.1.6
- 0.1.5
- 0.1.4
- 0.1.3
- 0.1.2
- 0.1.1
- 0.1.0
- 0.0.12
- 0.0.11
- 0.0.10
- 0.0.9
- 0.0.8
- 0.0.7
- 0.0.6
- 0.0.5
- 0.0.4
- 0.0.3
- 0.0.2
- 0.0.1
- Owners
-
**petgraph** is a graph data structure library.
- [`Graph`](./graph/struct.Graph.html) which is an adjacency list graph with
arbitrary associated data.
- [`StableGraph`](./stable_graph/struct.StableGraph.html) is similar
to `Graph`, but it keeps indices stable across removals.
- [`GraphMap`](./graphmap/struct.GraphMap.html) is an adjacency list graph
which is backed by a hash table and the node identifiers are the keys
into the table.
- [`CSR`](./csr/struct.Csr.html) is a sparse adjacency matrix graph with
arbitrary associated data.
Optional crate feature: `"serde-1"`, see the Readme for more information.