Lines Matching refs:edges
229 (with k ? 0) means that the graph part that is reachable via edges
306 /* Structs enum definitions for edges. */
357 edges of a class less or equal to a constant k specify folding
369 the incoming and outgoing edges. One can think of rubberbands instead
370 of edges that pull a node into its position. The priority of an edges
394 at the source node (the backarrow head). Normal edges only have the
410 lines long, and outgoing edges are related to label lines. (E.g.,
422 level the edge has to be drawn. Other edges which do not have this
453 we want to express that an edge points to a subgraph. Such edges
601 splines are used to draw edges, to prevent sharp bendings.
624 /* hidden specifies the classes of edges that are hidden.
625 Edges that are within such a class are not laid out nor drawn.
626 Nodes that are only reachable (forward or backward) by edges of an
629 of classes of hidden edges allows to hide parts of a graph, e.g.,
633 difference between hiding of edges and the edge line style invisible.
634 Hidden edges are not existent in the layout. Edges with line style
663 algorithm partitions the set of edges into edges pointing upward,
664 edges pointing downward, and edges pointing sidewards. The last type
665 of edges is also called near edges. If the layout.downfactor is
667 then the positions of the nodes is mainly determined by the edges
670 the nodes is mainly determined by the edges pointing upwards. If the
672 mainly determined by the edges pointing sidewards. These attributes
704 tries to give all edges the same length.
715 specialized method: It forces straight long edges with 90 degree,
718 if an orthogonal layout is selected (see manhattan.edges).
722 /* manhattan edges yes switches the orthogonal layout on. Orthogonal
723 layout (or manhattan layout) means that all edges consist of line
725 by shared by several edges, while horizontal edge segments are never
734 /* Smanhattan edges yes switches a specialized orthogonal layout on:
737 but horizontal edge segments are shared by several edges, too. This
743 /* Near edges no suppresses near edges and bent near edges in the
765 /* Port sharing no suppresses the sharing of ports of edges at the
766 nodes. Normally, if multiple edges are adjacent to the same node,
767 and the arrow head of all these edges has the same visual appearance
768 (color, size, etc.), then these edges may share a port at a node,
769 i.e. only one arrow head is draw, and all edges are incoming into
770 this arrow head. This allows to have many edges adjacent to one node
790 factor is greater than 0.5, the tree edges are spread, i.e. they
810 graphs with very large average degree of edges (number of incoming
811 and outgoing edges at a node), the weight bary is the fastest
857 /* Edges no suppresses the drawing of edges.
859 enum decision edges;
865 /* Splines specifies whether splines are used to draw edges (yes or no).
866 As default, polygon segments are used to draw edges, because this is
931 /* List of edges declared.
