Class EdgeGraph
Helper class to simplify edge traversal for a set of connected edges in a body
Assembly: ABB.Robotics.RobotStudio.Stations.dll
Syntax
public class EdgeGraph : IDisposable
Constructors
EdgeGraph(IEnumerable<Edge>)
Creates a new EdgeGraph from a collection of edges
Declaration
public EdgeGraph(IEnumerable<Edge> edges)
Parameters
Properties
IsConnected
Returns true if the graph is connected, i.e. all edges and vertices are connected to one another
Declaration
public bool IsConnected { get; }
Property Value
IsCycle
Returns true if the edges and vertices of the graph form a closed cycle
Declaration
public bool IsCycle { get; }
Property Value
IsLinear
Returns true if the graph is linear.
Declaration
public bool IsLinear { get; }
Property Value
IsTree
Returns true if the graph is tree-shaped.
Declaration
public bool IsTree { get; }
Property Value
Methods
Dispose()
Releases the resources allocated by this EdgeGraph
Declaration
Finalize()
Declaration
protected void Finalize()
GetEdges()
Returns all edges in the graph
Declaration
Returns
GetLeaves()
Returns all vertices that are leaves (endpoints), i.e. all vertices that are connected to only one edge.
Declaration
public Vertex[] GetLeaves()
Returns
GetShortestCycle(Vertex)
Declaration
public EdgeGraph GetShortestCycle(Vertex vertex)
Parameters
Type |
Name |
Description |
Vertex |
vertex |
|
Returns
GetShortestPath(Vertex, Vertex, Boolean)
Declaration
public EdgeGraph GetShortestPath(Vertex startVertex, Vertex endVertex, bool weighted)
Parameters
Returns
GetVertices()
Returns all vertices in the graph
Declaration
public Vertex[] GetVertices()
Returns
SplitDisjunct()
Splits the graph so that each new graph is connected
Declaration
public EdgeGraph[] SplitDisjunct()
Returns
Subtract(EdgeGraph)
Declaration
public EdgeGraph Subtract(EdgeGraph other)
Parameters
Returns