![]() |
Satsuma
a delicious .NET graph library
|
A graph which can provide information about its arcs. More...
Public Member Functions | |
| bool | IsEdge (Arc arc) |
Returns whether the arc is undirected (true) or directed (false). More... | |
| Node | U (Arc arc) |
| Returns the first node of an arc. Directed arcs point from U to V. More... | |
| Node | V (Arc arc) |
| Returns the second node of an arc. Directed arcs point from U to V. More... | |
A graph which can provide information about its arcs.
| bool Satsuma.IArcLookup.IsEdge | ( | Arc | arc | ) |
Returns whether the arc is undirected (true) or directed (false).
Implemented in Satsuma.PathGraph, Satsuma.Supergraph, Satsuma.Path, Satsuma.CompleteBipartiteGraph, Satsuma.Subgraph, Satsuma.CompleteGraph, Satsuma.ContractedGraph, Satsuma.Matching, Satsuma.RedirectedGraph, Satsuma.ReverseGraph, and Satsuma.UndirectedGraph.
Returns the first node of an arc. Directed arcs point from U to V.
Implemented in Satsuma.PathGraph, Satsuma.Supergraph, Satsuma.Path, Satsuma.CompleteBipartiteGraph, Satsuma.Subgraph, Satsuma.CompleteGraph, Satsuma.ContractedGraph, Satsuma.Matching, Satsuma.RedirectedGraph, Satsuma.ReverseGraph, and Satsuma.UndirectedGraph.
Returns the second node of an arc. Directed arcs point from U to V.
Implemented in Satsuma.PathGraph, Satsuma.Supergraph, Satsuma.Path, Satsuma.CompleteBipartiteGraph, Satsuma.Subgraph, Satsuma.CompleteGraph, Satsuma.ContractedGraph, Satsuma.Matching, Satsuma.RedirectedGraph, Satsuma.ReverseGraph, and Satsuma.UndirectedGraph.
1.8.3.1