ClassGridRouter
Routing based on the A* algorithm.
Definition
Namespace:Telerik.Windows.Diagrams.Core
Assembly:Telerik.Windows.Diagrams.Core.dll
Syntax:
public sealed class GridRouter : RoutingBase, IRouterInheritance: objectRoutingBaseGridRouter
Implements:
Constructors
GridRouter(IGraphInternal)
Initializes a new instance of the GridRouter class.
Declaration
public GridRouter(IGraphInternal diagram)Parameters
diagram
The diagram.
GridRouter(IGraphInternal, Func<Point, bool>)
Initializes a new instance of the GridRouter class.
Declaration
public GridRouter(IGraphInternal diagram, Func<Point, bool> locationDelegate)Parameters
diagram
The diagram.
locationDelegate
The location delegate.
Properties
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
source
IEnumerable<Point>
The source.
Returns
Point?
GetRoutePoints(IConnection, bool)
Gets the route points.
Declaration
public override IList<Point> GetRoutePoints(IConnection connection, bool showLastLine = true)Parameters
connection
The connection.
showLastLine
If set to true the intermediate points will be added to the resulting path.
Returns
IList<Point>
Overrides
RemoveLoops(IList<Point>)
Removes the loops in the point list.
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
startPoint
Point
endPoint
Point
Returns
IList<Point>