public static List <Point> Dijkstra (Point start, Point end, List <Point> polygon) { var algorithm = new RoutingAlgorithmDijkstra(start, end, polygon); return(Apply(algorithm)); }
public static List <Point> Dijkstra (Point start, Point end, List <Point> polygon) { var algorithm = new RoutingAlgorithmDijkstra(start, end, polygon); var result = algorithm.ShortestRoute(); return(result); }
static void Main(string[] args) { RoutingAlgorithm algorithm = new RoutingAlgorithmDijkstra(); string[] input = File.ReadAllLines("obstacle.dat"); algorithm.ParseInput(input[0], input[1], input[2]); var path = algorithm.ShortestRoute(); var result = path.PolylineLength().Round(2).ToString(); Console.WriteLine(result); }
public static List<Point> Dijkstra(Point start, Point end, List<Point> polygon) { var algorithm = new RoutingAlgorithmDijkstra(start, end, polygon); return Apply(algorithm); }