readme notes
parent
9e8bc14a40
commit
0ccdf2768a
|
@ -14,4 +14,10 @@ A GC-friendly graph theory library for C# intended for use with games.
|
|||
|
||||
## Notes
|
||||
|
||||
`Graph` algorithms return lazy enumerators to avoid creating GC pressure. If you wish to hang on to the results of an evaluation, make sure to call `ToArray()` or `ToList()` on the IEnumerable.
|
||||
`Graph` algorithms return lazy enumerators to avoid creating GC pressure. If you wish to hang on to the results of an evaluation, make sure to call `ToArray()` or `ToList()` on the IEnumerable.
|
||||
|
||||
### TODO
|
||||
|
||||
* Prim Minimum Spanning Tree
|
||||
* Kruskal Minimum Spanning Tree
|
||||
* Undirected Weighted Multigraph
|
Loading…
Reference in New Issue