Click or drag to resize
GraphExtensions Class
The static graph-analysis related extensions.
Inheritance Hierarchy
SystemObject
  Telerik.Windows.Diagrams.CoreGraphExtensions

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 static class GraphExtensions

The GraphExtensions type exposes the following members.

Methods
  NameDescription
Public methodStatic memberAssignLevelTLinkData
Assigns tree-levels to the nodes.
Public methodStatic memberBreadthFirstSearchTNode, TLink
Performs a BFT of the given graph starting at the given node and stops when the first node matching the condition is found.
Public methodStatic memberBreadthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, ActionTNode, TNode)
Performs a breadth-first traversal of the graph starting at the given node.
Public methodStatic memberBreadthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, IVisitorTNode, TNode)
Performs a breadth-first traversal of the graph starting at the given node.
Public methodStatic memberCloneTNodeData, TLinkData
Returns a shallow clone from the given collection.
Public methodStatic memberCreateArray(Int32, Int32)
Returns an array of the specified size.
Public methodStatic memberCreateArray(Int32, Int32, Int32)
Returns an array of the specified size.
Public methodStatic memberCreateBalancedForest
Creates a forest of balanced trees.
Public methodStatic memberCreateBalancedTree
Creates a balanced tree.
Public methodStatic memberCreateBiDictionaryTNode, TLink
Creates a bi-directional dictionary with keys equal to the (supposedly unique) identifiers and value equal to the provided initial value.
Public methodStatic memberCreateComponents
Creates a random graph with a specified amounts of components.
Public methodStatic memberCreateDictionaryTNode, TLink
Creates a dictionary with keys equal to the (supposedly unique) identifiers and value equal to the provided initial value.
Public methodStatic memberCreateRandomConnectedGraph
Creates a random connected graph.
Public methodStatic memberCreateRandomGraph
Creates a random graph.
Public methodStatic memberDepthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, ActionTNode, TNode)
Performs a depth-first traversal of the graph starting at the given node.
Public methodStatic memberDepthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, ActionTNode, Int32, TNode)
Performs a depth-first traversal of the graph starting at the given node.
Public methodStatic memberDepthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, IDepthVisitorTNode, TNode)
Performs a depth-first traversal of the graph starting at the given node.
Public methodStatic memberDepthFirstTraversalTNode, TLink(GraphBaseTNode, TLink, IVisitorTNode, TNode)
Performs a depth-first traversal of the graph starting at the given node.
Public methodStatic memberFindCyclesTNode, TLink
Finds cycles in a graph using Tarjan strongly connected components algorithm.
Public methodStatic memberHasIdenticalStructureWith
Compares the two graph and assert they are identical.
Public methodStatic memberKruskalsSpanningTreeTNode, TLink
Kruskal algorithm.
Public methodStatic memberMerge
Merges the given graph into the current graph.
Public methodStatic memberMoveGraphTNodeData, TLinkData
Offsets the specified graph.
Public methodStatic memberMoveLinkTNodeData, TLinkData
Moves link.
Public methodStatic memberOffset
Offsets the given rectangle.
Public methodStatic memberParse
Parses the specified list representing the incidence structure of a graph.
Public methodStatic memberPosition
Returns the position of the given rectangle.
Public methodStatic memberPrimsSpanningTreeTNode, TLink
Prim's algorithm finds a minimum-cost spanning tree of an edge-weighted, connected, undirected graph.
Public methodStatic memberSplitTNodeData, TLinkData
Splits the given, not necessarily connected, graph into its connected components.
Public methodStatic memberTakeRandomNode
Takes a random node with incidence less than specified.
Public methodStatic memberTakeTwoRandomNodes
Takes two random nodes from the given graph.
Public methodStatic memberTarjansStronglyConnectedComponentsAlgorithmTNode, TLink
Executes Tarjan algorithm on the graph.
Public methodStatic memberUnionEmptyRects
If the first supplied rectangle has width or height zero the second rectangle will be returned. Otherwise the standard union of two rectangles will be used.
Public methodStatic memberUnionRects Obsolete.
Returns the smallest possible rectangle containing both of the specified rectangles.
Top
See Also