Here is a list of all class members with links to the classes they belong to:

- g -

• GetArc() : Satsuma.CompleteBipartiteGraph , Satsuma.CompleteGraph
• GetBlueNode() : Satsuma.CompleteBipartiteGraph
• GetBoundary() : Satsuma.Drawing.INodeShape , Satsuma.Drawing.NodeShape
• GetChildren() : Satsuma.ContractedGraph
• GetDistance() : Satsuma.BellmanFord , Satsuma.Dijkstra , Satsuma.AStar
• GetHashCode() : Satsuma.DisjointSetSet< T > , Satsuma.Node , Satsuma.Arc , Satsuma.Drawing.PointD
• GetKeyElement() : Satsuma.IO.GraphML.NodeGraphicsProperty , Satsuma.IO.GraphML.GraphMLProperty , Satsuma.IO.GraphML.StandardProperty< T >
• GetLevel() : Satsuma.Bfs
• GetNode() : Satsuma.CompleteGraph , Satsuma.PathGraph
• GetNodeIndex() : Satsuma.CompleteGraph , Satsuma.PathGraph
• GetParentArc() : Satsuma.BellmanFord , Satsuma.Bfs , Satsuma.Dijkstra
• GetPath() : Satsuma.AStar , Satsuma.BellmanFord , Satsuma.Bfs , Satsuma.Dijkstra
• GetRedNode() : Satsuma.CompleteBipartiteGraph
• GetRepresentative() : Satsuma.ContractedGraph
• GetTourCost< TNode >() : Satsuma.TspUtils
• Graph : Satsuma.BellmanFord , Satsuma.Dijkstra , Satsuma.Drawing.ForceDirectedLayout , Satsuma.IFlow< TCapacity > , Satsuma.MaximumMatching , Satsuma.HamiltonianCycle , Satsuma.Dfs , Satsuma.AStar , Satsuma.Path , Satsuma.IMatching , Satsuma.IO.LemonGraphFormat , Satsuma.Prim< TCost > , Satsuma.Preflow , Satsuma.BiNodeConnectedComponents , Satsuma.MinimumCostMatching , Satsuma.Kruskal< TCost > , Satsuma.Bipartition , Satsuma.TopologicalOrder , Satsuma.NetworkSimplex , Satsuma.StrongComponents , Satsuma.IntegerPreflow , Satsuma.Matching , Satsuma.IO.SimpleGraphFormat , Satsuma.Drawing.GraphDrawer , Satsuma.IO.GraphML.GraphMLFormat , Satsuma.Bfs , Satsuma.ConnectedComponents , Satsuma.BiEdgeConnectedComponents
• GraphDrawer() : Satsuma.Drawing.GraphDrawer
• GraphMLFormat() : Satsuma.IO.GraphML.GraphMLFormat
• GraphMLProperty() : Satsuma.IO.GraphML.GraphMLProperty
• GreedyGrow() : Satsuma.MaximumMatching