Erdogan, Şenol ZaferEsin, E. Murat2024-07-122024-07-122006Erdoğan, Ş. Z. ve Esin, E.M. (2006). An application of two different algorithms on the same network. 2006 International Symposium on Communications and Information Technologies, ISCIT. s. 1162-116610.1109/ISCIT.2006.3399632-s2.0-50949098134https://dx.doi.org/10.1109/ISCIT.2006.339963https://hdl.handle.net/20.500.12415/31432006 International Symposium on Communications and Information Technologies, ISCIT -- 18 October 2006 through 20 October 2006 -- Bangkok -- 73067In this study, Dijkstra algorithm and self cloning ant colony approach are explained. Dijkstra is a well known algorithm to find the shortest path. Self cloning ant colony approach is a new method to find the optimal path between the pair of the nodes in an unknown net topology. Both methods are applied on the same network and the results and differences are shown. © 2006 IEEE.eninfo:eu-repo/semantics/closedAccessAnt colony systemComputer networksSelf cloning antShortest pathConference Object11661162