i've been coding in Ant Colony Optimization and Genetic Algorithm for a problem that i've been working on. It's basically finding a shortest path given a start point and end point. however it struck me that since i'm doing path-finding, couldn't i apply Dijkstra's algorithm or variants of it?

so my question is: which algorithm would perform faster? dijkstra, ACO or GA? for that matter, how and why is the algorithm faster?

i know that dijkstra has a time complexity of O(n^2). what about ACO and GA? any ideas? i could not find any information regarding the time complexity for ACO and GA. i'm trying to do comparisions for these algorithms to see which one is the best. if possible, please try to quote the sources of information.

i've 30 nodes and an average of 6 edges per node.

thanks!!