future_net using aco and dijsktra. this problem can be understood to solve desinated point shortest path with directed graph with loops and an NP-hard problem.Find the better valid path with aco and make the optimization to get the best path with dijsktra algorithm!