petgraph 0.4.13

Graph data structure library. Provides graph types and graph algorithms.
Documentation 
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

<!--
  -- Thanks for filing a `petgraph` issue! Fill out the appropriate template
  -- below. We appreciate it :)
  -->

<!-- ************************ BUG REPORTS *************************** -->

### Test Case

Insert your test case here, ideally in the form of Rust code that creates a
graph.

### Steps To Reproduce

Insert instructions for reproducing the bug with the above test case:

* First, ...
* Then, ...
* ...

Bonus points if these STR are in the form of a `#[test]` that demonstrates the
bug, and can be used as a regression test once the bug is fixed

### Actual Results

Insert a panic backtrace here, or wrong answer, or whatever.

### Expected Results

The correct result / behavior that you expect when following the STR with the
test case. Maybe a `None` returned instead of a panic, or some node A instead of
the node B that was returned.

<!-- ************************ FEATURE REQUESTS ************************ -->

### Summary

A couple sentence summary of the requested feature.

### Motivation

What does adding this feature enable that isn't possible without it? Does it
improve performance? Turn dynamic checks into statically enforced properties?
Explain why this feature should be implemented.

### Details

* What code needs to change? New traits? Which modules?

* Is this a new graph algorithm? Include links to papers, Wikipedia, or other
  implementations of this algorithm that exist.

* Are you willing to implement this yourself? Mentor someone else and help them
  implement it?