bool RoutePathsWithSteinerDijkstra()
{
shortestPathRouter.VisibilityGraph = VisibilityGraph;
shortestPathRouter.BundlingSettings = bundlingSettings;
shortestPathRouter.EdgeGeometries = regularEdges.Select(e => e.EdgeGeometry).ToArray();
shortestPathRouter.ObstacleHierarchy = LooseHierarchy;
shortestPathRouter.RouteEdges();
//find appropriate edge separation
if (shortestPathRouter.Cdt != null)
{
if (!AnalyzeEdgeSeparation())
{
return(false);
}
}
return(true);
}
