Class GridRouter
Routing based on the A* algorithm.
Inherited Members
Namespace: Telerik.Windows.Diagrams.Core
Assembly: Telerik.WinControls.RadDiagram.dll
Syntax
public sealed class GridRouter : RoutingBase, IRouter
Constructors
GridRouter(IGraphInternal)
Initializes a new instance of the Grid
Declaration
public GridRouter(IGraphInternal diagram)
Parameters
IGraph The diagram. |
GridRouter(IGraphInternal, Func<Point, Boolean>)
Initializes a new instance of the Grid
Declaration
public GridRouter(IGraphInternal diagram, Func<Point, bool> locationDelegate)
Parameters
IGraph The diagram. |
System. The location delegate. |
Properties
Cutoff
This is a cutoff for the A*-search and represents the buffer of points.
Declaration
public static int Cutoff { get; set; }
Property Value
System.
|
Methods
FindDuplicate(IEnumerable<Point>)
Finds the duplicate in the list of points which leads to loops in the paths.
Declaration
public static Point? FindDuplicate(IEnumerable<Point> source)
Parameters
System. The source. |
Returns
System.
|
GetRoutePoints(IConnection, Boolean)
Gets the route points.
Declaration
public override IList<Point> GetRoutePoints(IConnection connection, bool showLastLine = true)
Parameters
IConnection
connection
The connection. |
System. If set to |
Returns
System.
|
Overrides
RemoveLoops(IList<Point>)
Removes the loops in the point list.
Declaration
public static IList<Point> RemoveLoops(IList<Point> points)
Parameters
System. The points. |
Returns
System.
|
Route(Point, Point)
Returns null, if no path is found. Start- and End-Node are included in returned path.
Declaration
public IList<Point> Route(Point startPoint, Point endPoint)
Parameters
Returns
System.
|