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