![]() |
Satsuma
a delicious .NET graph library
|
Go to the source code of this file.
Classes | |
| struct | Satsuma.Arc |
| Represents a graph arc, consisting of a wrapped Id. More... | |
| class | Satsuma.ArcLookupExtensions |
| Extension methods for IArcLookup. More... | |
| class | Satsuma.CustomGraph |
| A graph implementation capable of storing any graph. More... | |
| interface | Satsuma.IArcLookup |
| A graph which can provide information about its arcs. More... | |
| interface | Satsuma.IBuildableGraph |
| A graph which can build new nodes and arcs. More... | |
| interface | Satsuma.IDestroyableGraph |
| A graph which can destroy its nodes and arcs. More... | |
| interface | Satsuma.IGraph |
| Interface to a read-only graph. More... | |
| struct | Satsuma.Node |
| Represents a graph node, consisting of a wrapped Id. More... | |
Namespaces | |
| package | Satsuma |
Enumerations | |
| enum | Satsuma.ArcFilter { Satsuma.All, Satsuma.Edge, Satsuma.Forward, Satsuma.Backward } |
| Allows filtering arcs. Can be passed to functions which return a collection of arcs. More... | |
| enum | Satsuma.Directedness { Satsuma.Directed, Satsuma.Undirected } |
| Tells whether an arc, an arc set or a graph is directed or undirected. More... | |
1.8.3.1