Search Results for

    Show / Hide Table of Contents

    Class EdgeGraph

    Helper class to simplify edge traversal for a set of connected edges in a body

    Inheritance
    object
    EdgeGraph
    Namespace: ABB.Robotics.RobotStudio.Stations
    Assembly: ABB.Robotics.RobotStudio.Stations.dll
    Syntax
    public class EdgeGraph

    Constructors

    View Source

    EdgeGraph(IEnumerable<Edge>)

    Creates a new EdgeGraph from a collection of edges

    Declaration
    public EdgeGraph(IEnumerable<Edge> edges)
    Parameters
    Type Name Description
    IEnumerable<Edge> edges

    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
    Type Description
    bool
    View Source

    IsCycle

    Returns true if the edges and vertices of the graph form a closed cycle

    Declaration
    public bool IsCycle { get; }
    Property Value
    Type Description
    bool
    View Source

    IsLinear

    Returns true if the graph is linear.

    Declaration
    public bool IsLinear { get; }
    Property Value
    Type Description
    bool
    View Source

    IsTree

    Returns true if the graph is tree-shaped.

    Declaration
    public bool IsTree { get; }
    Property Value
    Type Description
    bool
    Remarks

    IsTree will be true also for linear graphs (as they can be considered degenerate trees).

    Methods

    View Source

    Dispose()

    Releases the resources allocated by this EdgeGraph

    Declaration
    public void Dispose()
    View Source

    ~EdgeGraph()

    Declaration
    protected ~EdgeGraph()
    View Source

    GetEdges()

    Returns all edges in the graph

    Declaration
    public Edge[] GetEdges()
    Returns
    Type Description
    Edge[]
    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
    Type Description
    Vertex[]
    View Source

    GetShortestCycle(Vertex)

    Declaration
    public EdgeGraph GetShortestCycle(Vertex vertex)
    Parameters
    Type Name Description
    Vertex vertex
    Returns
    Type Description
    EdgeGraph
    View Source

    GetShortestPath(Vertex, Vertex, bool)

    Declaration
    public EdgeGraph GetShortestPath(Vertex startVertex, Vertex endVertex, bool weighted)
    Parameters
    Type Name Description
    Vertex startVertex
    Vertex endVertex
    bool weighted
    Returns
    Type Description
    EdgeGraph
    View Source

    GetVertices()

    Returns all vertices in the graph

    Declaration
    public Vertex[] GetVertices()
    Returns
    Type Description
    Vertex[]
    View Source

    SplitDisjunct()

    Splits the graph so that each new graph is connected

    Declaration
    public EdgeGraph[] SplitDisjunct()
    Returns
    Type Description
    EdgeGraph[]
    View Source

    Subtract(EdgeGraph)

    Declaration
    public EdgeGraph Subtract(EdgeGraph other)
    Parameters
    Type Name Description
    EdgeGraph other
    Returns
    Type Description
    EdgeGraph
    • View Source
    In this article
    Back to top Copyright © 2026 ABB Robotics