A GC-friendly graph theory library for C# intended for use with games.
Graph implements various algorithms on the following graph structures:
- Directed
- Directed Weighted
- Directed Weighted Multigraph
- Undirected
- Undirected Weighted
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.
- change Neighbors tests to use Equal instead of Contains
- change Edge id from a Guid to an integer index on the edge
- Prim Minimum Spanning Tree
- Kruskal Minimum Spanning Tree
- Undirected Weighted Multigraph