using System.Collections.Generic;
/// <summary>
/// Author:Laughing
/// Date:2024-05-07 23:09
/// 说明：客户对象基本信息
/// </summary>
class Customer
{
    public string Name { get; set; }//客户名称
    public DateTime EarliestDeliveryTime { get; set; }//预约的最早时间
    public DateTime LatestDeliveryTime { get; set; }//预约的最迟时间
    public string Location { get; set; } //当前地点
    //在构造函数中完成客户信息初始化
    public Customer(string name, DateTime earliest, DateTime latest, string location)
    {
        Name = name;
        EarliestDeliveryTime = earliest;
        LatestDeliveryTime = latest;
        Location = location;
    }
}
/// <summary>
/// Author:Laughing
/// Date:2024-05-07 23:42
/// 说明：送货路线算法
/// </summary>
class DeliveryRoutePlanner
{
    //用字典存储节点间的时间和距离信息
    private Dictionary<(string, string), (int timing, double distance)> distanceMatrix;
    //构造函数用于初始化信息
    public DeliveryRoutePlanner(Dictionary<(string, string), (int timing, double distance)> matrix)
    {
        distanceMatrix = matrix;
    }

    public List<string> PlanRoute(string startLocation, List<Customer> customers, int stayTimePerCustomer = 10)
    {
        var route = new List<string> { startLocation }; // 开始于起点A  
        var currentLocation = startLocation;
        var currentTime = new DateTime(DateTime.Now.Year, DateTime.Now.Month, DateTime.Now.Day, 6, 0, 0);
        var priorityQueue = new PriorityQueue<Customer, double>(); // 优先级队列，根据到达时间  

        // 插入有预约时间的顾客到优先队列中  
        foreach (var customer in customers.Where(c => c.EarliestDeliveryTime != DateTime.MinValue))
        {
            var travelTime = GetTravelTime(currentLocation, customer.Location);//计算当前节点到下一节点所需时间
            var arrivalTime = currentTime.AddMinutes(travelTime);
            if (arrivalTime <= customer.LatestDeliveryTime)
            {
                priorityQueue.Enqueue(customer, arrivalTime.Ticks); // 使用Ticks作为优先级  
            }
        }

        // 插入无预约时间的顾客到优先队列中（假设使用无穷大的时间）  
        foreach (var customer in customers.Where(c => c.EarliestDeliveryTime == DateTime.MinValue))
        {
            priorityQueue.Enqueue(customer, long.MaxValue);
        }

        while (priorityQueue.TryDequeue(out var customer, out _))
        {
            var travelTime = GetTravelTime(currentLocation, customer.Location);
            currentTime = currentTime.AddMinutes(travelTime);
            currentTime = currentTime.AddMinutes(stayTimePerCustomer); // 停留时间  

            if (currentTime > customer.LatestDeliveryTime && customer.LatestDeliveryTime != DateTime.MinValue)
            {
                // 如果超过了预约时间，则跳过该顾客（或进行其他处理）  
                continue;
            }

            route.Add(customer.Location);
            currentLocation = customer.Location;
        }

        return route;
    }
    /// <summary>
    /// 获取当前节点到下一节点所需时间
    /// </summary>
    /// <param name="from">当前节点</param>
    /// <param name="to">下一节点</param>
    /// <returns>返回矩阵表中定义的从一个节点到另一节点所需时间</returns>
    private int GetTravelTime(string from, string to)
    {
        return distanceMatrix[(from, to)].timing;
    }
}

// 使用示例  
class Program
{
    static void Main()
    {
        // 初始化距离矩阵
        var distanceMatrix = new Dictionary<(string, string), (int timing, double distance)>
        {
            // 填充A到B、C、D、E的时间和距离...  
        };
        var customers = new List<Customer>
        {
            // 填充顾客B、C、D、E的信息...  
        };
        var planner = new DeliveryRoutePlanner(distanceMatrix);//实例化对象
        List<string> minTimeLines = planner.PlanRoute("A", customers);//调用获取最优路径方法，返回最优路径List对象

   }
}