find the path streets using ant colony system in java -
i had names of roads , connected
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) { (int = 0;i < track.size(); i++) { if(track.get(i).getnamestreet().equalsignorecase(source)) { first = i; system.out.println(track.get(awal).getnamestreet()); (int j = 0;j < track.get(awal).getconnected().length;j++) { next=i; } } }
how path of - j ? i'm trying use ant colony optimization find best streets. can me solve problem ? or maybe have reference ant colony optimization find best streets.
Comments
Post a Comment