The SFlow layout algorithm allows performing a symmetric layout on a graph. The symmetric layout produces a high degree of symmetry and is particularly useful for undirected graphs, where the directions of the edge are not important. The resulting layout is often good. However it requires considerable computational resources and therefore should be used for small graphs (less than 300 nodes).