It should be one of “solid”, “dashed”, “dotted”, dashdot”, or “-”, “–”, “:”, “-.”, respectively. Currently unavailable for Multi-edged DiGraphs. This can be True/ False to indicate whether to print the vertex string representation of not, a dictionary keyed by vertices and associating to each vertex a label string, or a function taking as input a vertex and returning a label string.ĭefault color for vertices not listed in vertex_colors dictionary.Ī dictionary specifying vertex colors: each key is a color recognizable by matplotlib, and each corresponding value is a list of vertices. Whether to do the spring layout by connected component – a boolean. Which graphviz layout program to use – one of “circo”, “dot”, “fdp”, “neato”, or “twopi”. Whether or not to save the computed position for the graph. The direction of tree branches – ‘up’, ‘down’, ‘left’ or ‘right’. If no root is specified for a tree, then one is chosen close to the center of the tree. Ignored unless layout='tree'.Īn iterable specifying which vertices to use as roots for the layout='forest' option. If no root is specified, then one is chosen close to the center of the tree. A vertex of the tree to be used as the root for the layout='tree' option. Use spring layout to finalize the current layout.Ī vertex designation for drawing trees. The number of times to execute the spring layout algorithm.Ī dictionary mapping heights to the list of vertices at this height. A layout algorithm – one of : “acyclic”, “circular” (plots the graph with vertices evenly distributed on a circle), “ranked”, “graphviz”, “planar”, “spring” (traditional spring layout, using the graph’s current positions as initial positions), or “tree” (the tree will be plotted in levels, depending on minimum distance for the root).
0 kommentar(er)
