Layout Algorithm speed

[gehpi_user]

Hello,
I have a question regarding the speed of layout algorithms. I've just started using Gephi and noticed that while some layout algorithms seem to finish allmost instant, some seem to take forever. E.g. the Forced-Athlas Algorithm is running several minutes on the example Dataset, while allmost every other algorithm is applied in under a second. What is causing this? Are certain alorithms not applicable to certain datasets?

Also, the Fruchterman Reingold Algorithm seems to produce a usefull visual result in seconds, but then keeps running minutes with no noticeable difference in visual shape of the graph.

Thanks in advance!