glax
f21845ced4
Add ToString to Route Simplify algorithm MinCoordinates and MaxCoordinates returns graph min/max always
42 lines
1.5 KiB
C#
42 lines
1.5 KiB
C#
namespace astar
|
|
{
|
|
public class Route(Graph graph, List<Step> steps, bool routeFound)
|
|
{
|
|
public Graph Graph { get; } = graph;
|
|
public List<Step> Steps { get; } = steps;
|
|
public bool RouteFound { get; } = routeFound;
|
|
public float Distance => Steps.Sum(step => step.Distance);
|
|
|
|
public ValueTuple<float, float> MinCoordinates()
|
|
{
|
|
float minLat = Graph.Nodes.MinBy(node => node.Value.Lat).Value.Lat;
|
|
float minLon = Graph.Nodes.MinBy(node => node.Value.Lon).Value.Lon;
|
|
return new ValueTuple<float, float>(minLat, minLon);
|
|
}
|
|
|
|
public ValueTuple<float, float> MaxCoordinates()
|
|
{
|
|
float maxLat = Graph.Nodes.MaxBy(node => node.Value.Lat).Value.Lat;
|
|
float maxLon = Graph.Nodes.MaxBy(node => node.Value.Lon).Value.Lon;
|
|
return new ValueTuple<float, float>(maxLat, maxLon);
|
|
}
|
|
|
|
public override string ToString()
|
|
{
|
|
return $"{string.Join("\n", Steps)}\n" +
|
|
$"Distance: {Distance:000000.00}m";
|
|
}
|
|
}
|
|
|
|
public struct Step(float distance, Node node1, Node node2)
|
|
{
|
|
public readonly Node Node1 = node1, Node2 = node2;
|
|
public readonly float Distance = distance;
|
|
|
|
public override string ToString()
|
|
{
|
|
return $"{Node1.Lat:00.000000} {Node1.Lon:000.000000} --- {Distance:0000.00}m ---> {Node2.Lat:00.000000} {Node2.Lon:000.000000}";
|
|
}
|
|
}
|
|
}
|