- a -

• Acyclic : Satsuma.TopologicalOrder
• ArcId : Satsuma.IO.GraphML.GraphMLFormat
• ArcMaps : Satsuma.IO.LemonGraphFormat
• ArcPen : Satsuma.Drawing.GraphDrawer
• Attributes : Satsuma.IO.LemonGraphFormat

- b -

• Bipartite : Satsuma.Bipartition
• BlueNodeCount : Satsuma.CompleteBipartiteGraph
• BlueNodes : Satsuma.Bipartition
• Bridges : Satsuma.BiEdgeConnectedComponents
• Brush : Satsuma.Drawing.NodeStyle

- c -

• Capacity : Satsuma.IFlow< TCapacity > , Satsuma.Preflow , Satsuma.IntegerPreflow
• Components : Satsuma.ConnectedComponents , Satsuma.StrongComponents , Satsuma.BiEdgeConnectedComponents , Satsuma.BiNodeConnectedComponents
• Cost : Satsuma.AStar , Satsuma.InsertionTsp< TNode > , Satsuma.Opt2Tsp< TNode > , Satsuma.BellmanFord , Satsuma.CheapestLinkTsp< TNode > , Satsuma.Dijkstra , Satsuma.MinimumCostMatching , Satsuma.NetworkSimplex , Satsuma.Prim< TCost > , Satsuma.Kruskal< TCost >
• Count : Satsuma.ConnectedComponents , Satsuma.StrongComponents , Satsuma.BiEdgeConnectedComponents , Satsuma.IReadOnlyPriorityQueue< TElement, TPriority > , Satsuma.BiNodeConnectedComponents , Satsuma.PriorityQueue< TElement, TPriority >
• Cutvertices : Satsuma.BiNodeConnectedComponents
• Cycle : Satsuma.HamiltonianCycle

- d -

• DefaultValue : Satsuma.IO.GraphML.DictionaryProperty< T >
• Degree : Satsuma.Kruskal< TCost >
• Directed : Satsuma.CompleteGraph , Satsuma.CompleteBipartiteGraph
• DirectedPen : Satsuma.Drawing.GraphDrawer
• Domain : Satsuma.IO.GraphML.GraphMLProperty

- e -

• ElectricForce : Satsuma.Drawing.ForceDirectedLayout
• Error : Satsuma.Preflow
• Extensions : Satsuma.IO.SimpleGraphFormat

- f -

• FirstNode : Satsuma.IPath , Satsuma.Path , Satsuma.PathGraph
• FixedNodes : Satsuma.Dijkstra
• FlowSize : Satsuma.IFlow< TCapacity > , Satsuma.Preflow , Satsuma.IntegerPreflow
• Forest : Satsuma.Prim< TCost > , Satsuma.Kruskal< TCost > , Satsuma.NetworkSimplex
• ForestGraph : Satsuma.Kruskal< TCost > , Satsuma.Prim< TCost >

- g -

• Graph : Satsuma.AStar , Satsuma.HamiltonianCycle , Satsuma.Kruskal< TCost > , Satsuma.Prim< TCost > , Satsuma.IntegerPreflow , Satsuma.Preflow , Satsuma.IFlow< TCapacity > , Satsuma.Path , Satsuma.NetworkSimplex , Satsuma.MinimumCostMatching , Satsuma.MaximumMatching , Satsuma.Matching , Satsuma.IMatching , Satsuma.Drawing.ForceDirectedLayout , Satsuma.IO.GraphML.GraphMLFormat , Satsuma.IO.LemonGraphFormat , Satsuma.IO.SimpleGraphFormat , Satsuma.Drawing.GraphDrawer , Satsuma.Dijkstra , Satsuma.Dfs , Satsuma.BiNodeConnectedComponents , Satsuma.BiEdgeConnectedComponents , Satsuma.StrongComponents , Satsuma.TopologicalOrder , Satsuma.Bipartition , Satsuma.ConnectedComponents , Satsuma.Bfs , Satsuma.BellmanFord

- h -

• HasDefaultValue : Satsuma.IO.GraphML.DictionaryProperty< T >
• Height : Satsuma.IO.GraphML.NodeGraphics
• Heuristic : Satsuma.AStar

- i -

• Id : Satsuma.Node , Satsuma.Arc , Satsuma.IO.GraphML.GraphMLProperty
• Invalid : Satsuma.Node , Satsuma.Arc
• IsRed : Satsuma.MinimumCostMatching , Satsuma.MaximumMatching
• Items : Satsuma.PriorityQueue< TElement, TPriority > , Satsuma.IReadOnlyPriorityQueue< TElement, TPriority >

- k -

• Kind : Satsuma.Drawing.NodeShape

- l -

• LastNode : Satsuma.IPath , Satsuma.Path , Satsuma.PathGraph
• Level : Satsuma.Dfs
• LowerBound : Satsuma.NetworkSimplex

- m -

• Matching : Satsuma.MaximumMatching , Satsuma.MinimumCostMatching
• MaxDegree : Satsuma.Kruskal< TCost >
• MaximumMatchingSize : Satsuma.MinimumCostMatching
• MinimumMatchingSize : Satsuma.MinimumCostMatching
• Mode : Satsuma.Dijkstra

- n -

• Name : Satsuma.IO.GraphML.GraphMLProperty
• NegativeCycle : Satsuma.BellmanFord
• NodeCaption : Satsuma.Drawing.GraphDrawer
• NodeId : Satsuma.IO.GraphML.GraphMLFormat
• NodeMaps : Satsuma.IO.LemonGraphFormat
• NodePosition : Satsuma.Drawing.GraphDrawer
• NodePositions : Satsuma.Drawing.ForceDirectedLayout
• Nodes : Satsuma.CheapestLinkTsp< TNode > , Satsuma.InsertionTsp< TNode >
• NodeStyle : Satsuma.Drawing.GraphDrawer
• NonzeroArcs : Satsuma.Preflow , Satsuma.IntegerPreflow , Satsuma.IFlow< TCapacity >
• NullCost : Satsuma.Dijkstra

- o -

• Order : Satsuma.TopologicalOrder

- p -

• Pen : Satsuma.Drawing.NodeStyle
• Properties : Satsuma.IO.GraphML.GraphMLFormat

- r -

• ReachedNodes : Satsuma.BellmanFord , Satsuma.Bfs , Satsuma.Dijkstra
• RedNodeCount : Satsuma.CompleteBipartiteGraph
• RedNodes : Satsuma.Bipartition
• Representative : Satsuma.DisjointSetSet< T >

- s -

• SelectionRule : Satsuma.InsertionTsp< TNode >
• Shape : Satsuma.Drawing.NodeStyle , Satsuma.IO.GraphML.NodeGraphics
• Size : Satsuma.Drawing.INodeShape , Satsuma.Drawing.NodeShape
• Source : Satsuma.IntegerPreflow , Satsuma.Preflow , Satsuma.IFlow< TCapacity >
• SpringForce : Satsuma.Drawing.ForceDirectedLayout
• StartIndex : Satsuma.IO.SimpleGraphFormat
• State : Satsuma.NetworkSimplex
• Supply : Satsuma.NetworkSimplex

- t -

• Target : Satsuma.IFlow< TCapacity > , Satsuma.Preflow , Satsuma.IntegerPreflow
• Temperature : Satsuma.Drawing.ForceDirectedLayout
• TemperatureAttenuation : Satsuma.Drawing.ForceDirectedLayout
• TextBrush : Satsuma.Drawing.NodeStyle
• TextFont : Satsuma.Drawing.NodeStyle
• this[object key] : Satsuma.IO.GraphML.DictionaryProperty< T >
• this[TElement element] : Satsuma.IPriorityQueue< TElement, TPriority > , Satsuma.PriorityQueue< TElement, TPriority >
• Tour : Satsuma.ITsp< TNode > , Satsuma.InsertionTsp< TNode > , Satsuma.Opt2Tsp< TNode > , Satsuma.CheapestLinkTsp< TNode >
• TourCost : Satsuma.CheapestLinkTsp< TNode > , Satsuma.InsertionTsp< TNode > , Satsuma.Opt2Tsp< TNode > , Satsuma.ITsp< TNode >

- u -

• UndirectedPen : Satsuma.Drawing.GraphDrawer
• UpperBound : Satsuma.NetworkSimplex
• UpperBoundArcs : Satsuma.NetworkSimplex

- v -

• Values : Satsuma.IO.GraphML.DictionaryProperty< T >

- w -

• Width : Satsuma.IO.GraphML.NodeGraphics

- x -

• X : Satsuma.IO.GraphML.NodeGraphics , Satsuma.Drawing.PointD

- y -

• Y : Satsuma.IO.GraphML.NodeGraphics , Satsuma.Drawing.PointD