Lines Matching full:edge
177 hidden by folding or edge classes) does not have fixed specified
191 ignored, if they are in conflict with near edge specifications.
294 | Edge attributs list. Structure that describes an edge. |
297 /* VCG Edge type. */
322 /* The struct edge itself. */
323 struct edge
326 /* Edge type.
327 Default is normal edge. */
330 /* Sourcename is the title of the source node of the edge.
334 /* Targetname is the title of the target node of the edge.
338 /* Label specifies the label of the edge. It is drawn if
339 display.edge.labels is set to yes.
343 /* Linestyle specifies the style the edge is drawn. Possibilities are:
344 ffl continuous a solid line is drawn ( -- ) ffl dashed the edge
345 consists of single dashes ( - - - ) ffl dotted the edge is made of
346 single dots ( \Delta \Delta \Delta ) ffl invisible the edge is not
352 /* Thickness is the thickness of an edge.
356 /* Class specifies the folding class of the edge. Nodes reachable by
362 /* color is the color of the edge.
366 /* textcolor is the color of the label of the edge. arrowcolor,
392 /* arrowstyle, backarrowstyle Each edge has two arrow heads: the one
409 where an edge goes out. This is useful, if node labels are several
416 /* Horizontal order is the horizontal position the edge. This is of
417 interest only if the edge crosses several levels because it specifies
418 the point where the edge crosses the level. within a level. The nodes
421 edge that crosses the level specifies between which two node of that
422 level the edge has to be drawn. Other edges which do not have this
431 ** Next edge node...
433 struct edge *next;
440 typedef struct edge edge;
453 we want to express that an edge points to a subgraph. Such edges
633 difference between hiding of edges and the edge line style invisible.
641 /* Classname allows to introduce names for the edge classes. The names
683 /* Late edge labels yes means that the graph is first partitioned and
690 /* Display edge labels yes means display labels and no means don't
691 display edge labels.
695 /* Dirty edge labels yes enforces a fast layout of edge labels, which
697 Dirty edge labels cannot be used if splines are used.
709 unconnected from the remaining graph. Such nodes have no edge at all
724 segments with gradient 0 or 90 degree. Vertical edge segments might
725 by shared by several edges, while horizontal edge segments are never
735 Here, all horizontal edge segments between two levels share the same
736 horizontal line, i.e. not only vertical edge segments are shared,
737 but horizontal edge segments are shared by several edges, too. This
739 the location of an edge might be ambiguously.
772 is used, each edge has its own port, i.e. its own place where it is
780 individually to each edge. But this can yield to a black spot, where
874 reduction of edge bendings.
925 edge edge;
933 edge *edge_list;
942 void new_edge (edge *e);
945 void add_edge (graph *g, edge *e);
956 void open_edge (edge *e, FILE *fout);
957 void output_edge (edge *e, FILE *fout);
