sfdp

sfdp is a fast, multilevel, force-directed algorithm that efficiently layouts large graphs, outlined in "Efficient and High Quality Force-Dircted Graph Drawing"¹.

Multiscale version of the fdp layout, for the layout of large graphs.

• PDF Manual
• Browse code

Attributes for sfdp features

• beautify – Whether to draw leaf nodes uniformly in a circle around the root node in sfdp.. Valid on: Graphs.
• dim – Set the number of dimensions used for the layout. Valid on: Graphs.
• dimen – Set the number of dimensions used for rendering. Valid on: Graphs.
• K – Spring constant used in virtual physical model. Valid on: Graphs, Clusters.
• label_scheme – Whether to treat a node whose name has the form |edgelabel|* as a special node representing an edge label.. Valid on: Graphs.
• levels – Number of levels allowed in the multilevel scheme. Valid on: Graphs.
• normalize – normalizes coordinates of final layout. Valid on: Graphs.
• overlap_scaling – Scale layout by factor, to reduce node overlap.. Valid on: Graphs.
• overlap_shrink – Whether the overlap removal algorithm should perform a compression pass to reduce the size of the layout. Valid on: Graphs.
• quadtree – Quadtree scheme to use. Valid on: Graphs.
• repulsiveforce – The power of the repulsive force used in an extended Fruchterman-Reingold. Valid on: Graphs.
• rotation – Rotates the final layout counter-clockwise by the specified number of degrees. Valid on: Graphs.
• smoothing – Specifies a post-processing step used to smooth out an uneven distribution of nodes.. Valid on: Graphs.
• start – Parameter used to determine the initial layout of nodes. Valid on: Graphs.
• voro_margin – Tuning margin of Voronoi technique. Valid on: Graphs.