Click or drag to resize
HyperTreeTNodeData, TLinkData Class
Represent the hierarchy of layout graphs through the hierarchy defined by the containers. The root is the global layout at the top level and if no containers are present or if the children of containers need not be organized this HyperTree will contain only one node, the root.
Inheritance Hierarchy
SystemObject
  Telerik.Windows.Diagrams.CoreGraphBaseNodeContainerGraphTNodeData, TLinkData, Object, EdgeContainerGraphTNodeData, TLinkData, Object
    Telerik.Windows.Diagrams.CoreGraphContainerGraphTNodeData, TLinkData, Object
      Telerik.Windows.Diagrams.CoreHyperTreeTNodeData, TLinkData

Namespace: Telerik.Windows.Diagrams.Core
Assembly: Telerik.Windows.Diagrams.Core (in Telerik.Windows.Diagrams.Core.dll) Version: 2017.2.614.40 (2017.2.614.40)
Syntax
public class HyperTree<TNodeData, TLinkData> : Graph<ContainerGraph<TNodeData, TLinkData>, Object>
where TNodeData : new()
where TLinkData : new()

Type Parameters

TNodeData
The type of the node data.
TLinkData
The type of the link data.

The HyperTreeTNodeData, TLinkData type exposes the following members.

Constructors
Methods
  NameDescription
Public methodAddLink(TLink)
Adds the given link to the graph. It will add the sink and source nodes to the Nodes collection if they are not yet part of it.
(Inherited from GraphBaseTNode, TLink.)
Public methodAddLink(TNode, TNode)
Adds a link to this graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodAddNode
Adds the given node to the graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodAddNodes
Adds a series of nodes to the graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodAreConnected(Int32, Int32, Boolean)
Returns whether the given nodes are connected in one direction or the other.
(Inherited from GraphBaseTNode, TLink.)
Public methodAreConnected(TNode, TNode, Boolean)
Returns whether the given nodes are connected in one direction or the other.
(Inherited from GraphBaseTNode, TLink.)
Public methodAreInSameComponent
Returns whether the two nodes with specified ide's are the in same component.
(Inherited from GraphBaseTNode, TLink.)
Public methodAssignIdentifiers
Assigns to each link and node an identifier based on their collection listIndex.
(Inherited from GraphBaseTNode, TLink.)
Public methodClone
Clones this instance.
(Inherited from GraphBaseTNode, TLink.)
Public methodDijkstraShortestPath
Returns the shortest path between two nodes using the Dijkstra algorithm.
(Inherited from GraphBaseTNode, TLink.)
Public methodEnsureUniqueIdentifiers
Ensures that the graph nodes all have a unique identifier assigned.
(Inherited from GraphBaseTNode, TLink.)
Public methodFindEdge
Finds the edge with the specified identifiers.
(Inherited from GraphBaseTNode, TLink.)
Public methodFindLongestPath
Finds the longest path in this (directed acyclic) graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodFindNode
Finds the node with the specified identifier.
(Inherited from GraphBaseTNode, TLink.)
Public methodFindTreeRoot
Attempts to find a tree root by looking at the longest paths in the graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodGetBoundingRectangleTNodeData, TLinkData
Returns the bounding rectangle of this layout graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodGetConnectedComponents
Returns the connected components of this graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodGetNextIdInNodes
Gets the next identifier of the nodes sequence.
(Inherited from GraphBaseTNode, TLink.)
Public methodHaveUniqueIdentifiers
Ensures the unique identifiers.
(Inherited from GraphBaseTNode, TLink.)
Public methodCode exampleNumberOfComponents
Returns the number of (connected) components.
(Inherited from GraphBaseTNode, TLink.)
Public methodNumberOfComponents(DictionaryInt32, Int32)
Returns the number of connected components.
(Inherited from GraphBaseTNode, TLink.)
Public methodRemoveAllLinksFrom
Detaches all links from from the given node and removes them from the graph structure.
(Inherited from GraphBaseTNode, TLink.)
Public methodRemoveLink
Removes the link from the graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodRemoveNode
Removes the given node from this graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodRenumberNodes
Assigns a new identifier to the nodes.
(Inherited from GraphBaseTNode, TLink.)
Public methodShortestPaths
Gets the shortest path lengths between each two vertices.
(Inherited from GraphBaseTNode, TLink.)
Public methodCode exampleToLinkListString
Returns a string representation of the incidence structure of this graph.
(Inherited from GraphBaseTNode, TLink.)
Public methodToLinksList
Returns the links structure of this graph as a list of identifier tuples.
(Inherited from GraphBaseTNode, TLink.)
Public methodTopologicalSort
Is a linear ordering of its vertices.
(Inherited from GraphBaseTNode, TLink.)
Public methodToString
Returns a String that represents this instance.
(Inherited from GraphBaseTNode, TLink.)
Top
Properties
  NameDescription
Public propertyDiagramControl
Gets DiagramControl.
(Inherited from GraphTNodeData, TLinkData.)
Public propertyIgnoredConnections
Gets or sets ignored connections.
(Inherited from GraphTNodeData, TLinkData.)
Public propertyIsAcyclic
Gets whether the graph is acyclic.
(Inherited from GraphBaseTNode, TLink.)
Public propertyIsConnected
Gets whether this graph is connected. See also this article; http://en.wikipedia.org/wiki/Connected_graph.
(Inherited from GraphBaseTNode, TLink.)
Public propertyIsDirected
Gets whether this graph is directed.
(Inherited from GraphBaseTNode, TLink.)
Public propertyIsHamiltonian
Gets whether the graph is hamiltonian.
(Inherited from GraphBaseTNode, TLink.)
Public propertyLinks
Gets or sets the links of this graph.
(Inherited from GraphBaseTNode, TLink.)
Public propertyNodes
Gets or sets the nodes of this graph.
(Inherited from GraphBaseTNode, TLink.)
Public propertyRoot
Gets the root Node of this Graph (assuming that the Graph is tree). If there is no root Node, returns null.
(Inherited from GraphTNodeData, TLinkData.)
Top
See Also