This thesis presents an investigation of four force directed graph drawing algorithms: Eades', Fruchterman and Reingold's, GEM by Frick, Ludwig and Mehldau and Barnes and Hut's. The first two algorithms target aesthetically pleasing layouts while the other two target algorithm complexity improvement and minimization of layouting time. Three algorithms are then explained from a practical perspective and are implemented into a prototype. The thesis then presents a brief overview and use cases of how graph automatic layouting can be applied to diagrams and to diagramming tools. This results in integrating one of the algorithms into the open source diagramming tool Dia.