New to Telerik UI for WPFStart a free 30-day trial

Graph analysis node description.

Definition

Namespace:Telerik.Windows.Diagrams.Core

Assembly:Telerik.Windows.Diagrams.Core.dll

Type Parameters:

TNode

The type of the node.

TLink

The type of the link.

Syntax:

C#
public interface INode<TNode, TLink> where TNode : INode<TNode, TLink> where TLink : IEdge<TNode, TLink>

Derived Classes: Node<TNodeData, TLinkData>TreeNode<TNode, TLink>

Properties

Gets all links bounds to this node.

C#
IList<TLink> AllLinks { get; }
Property Value:

All links.

Gets or sets the bounding rectangle.

C#
Rect BoundingRectangle { get; set; }
Property Value:

The bounding rectangle.

Remarks:

This defines the location as well as the size of the shape as a result of a layout process.

Gets the children nodes attached to this node.

C#
IEnumerable<TNode> Children { get; }
Property Value:

The children collection.

Remarks:
  • A child is defined as the opposite node from an edge starting at this node.
  • If the graph is not directed this will return the same collection as the Children and the Neighbors property, i.e. all the nodes attached to the this node.

Returns the total number of links attached.

C#
int Degree { get; }

Gets or sets the (supposed unique) identifier.

C#
int Id { get; set; }
Property Value:

The identifier of this node.

Gets the incoming links, i.e. the links towards this node.

C#
IList<TLink> Incoming { get; }
Property Value:

The incoming links.

Gets or sets a value indicating whether this node is part of directed graph.

C#
bool IsDirected { get; set; }
Property Value:

true if this instance is directed; otherwise, false.

Gets or sets whether this node is the root of a tree.

C#
bool IsRoot { get; set; }
Property Value:

true if this instance is root; otherwise, false.

Gets the nodes adjacent to this node, i.e. both the Parents and Children nodes.

C#
IEnumerable<TNode> Neighbors { get; }
Property Value:

All the neighbors nodes of this node.

Gets the outgoing links, i.e. the links leaving this node.

C#
IList<TLink> Outgoing { get; }
Property Value:

The outgoing.

Gets the parent nodes attached to this node.

C#
IEnumerable<TNode> Parents { get; }
Property Value:

The parent collection.

Remarks:
  • A parent is defined as the opposite node from an edge ending at this node.
  • If the graph is not directed this will return the same collection as the Children and the Neighbors property, i.e. all the nodes attached to the this node.

Methods

Adds an incoming link.

C#
void AddIncomingEdge(TLink edge)
Parameters:edgeTLink

The link to add.

Adds an outgoing link.

C#
void AddOutgoingEdge(TLink edge)
Parameters:edgeTLink

The link to add.

Returns a shallow copy of this node.

C#
TNode Clone()
Returns:

TNode

Removes an incoming edge.

C#
void RemoveIncomingEdge(TLink edge)
Parameters:edgeTLink

The edge to remove.

Removes a link from this node.

C#
void RemoveLink(TLink link)
Parameters:linkTLink

The link.

Removes the given outgoing edge.

C#
void RemoveOutgoingEdge(TLink edge)
Parameters:edgeTLink

The edge to remove.