java - 在java中使用蚁群系统查找路径街道

Question

我有道路的名称，它们是相连的

public static void inisial(ArrayList track)
{
        String[] connected = {"B","C","D","K","L"};
        information = new Street("A",connected); 
        track.add(information);

        String[] connected = {"E","F","G","A"};
        information = new Street("K",connected); 
        track.add(information);

        String[] connected = {"H","I","J","A"};
        information = new Street("L",connected); 
        track.add(information);
}

public static Street findStreet (String source, String destination)
{
    for (int i = 0;i < track.size(); i++)
    {
      if(track.get(i).getNameStreet().equalsIgnoreCase(source))
      {
        first = i;
        System.out.println(track.get(awal).getNameStreet());
        for (int j = 0;j < track.get(awal).getConnected().length;j++) 
        {
          next=i;
        }
    }
}

我如何获得 A - J 的路径？我正在尝试使用蚁群优化来找到最好的街道。任何人都可以帮我解决这个问题吗？或者也许你有关于蚁群优化的参考，以找到最好的街道。