|
Functions |
| void | acyclic (Agraph_t *) |
| void | add_to_component (Agnode_t *) |
| void | allocate_ranks (Agraph_t *) |
| void | basic_merge (Agedge_t *, Agedge_t *) |
| void | begin_component (void) |
| void | build_ranks (Agraph_t *, int) |
| void | build_skeleton (Agraph_t *, Agraph_t *) |
| void | class1 (Agraph_t *) |
| void | class2 (Agraph_t *) |
| void | cleanup1 (Agraph_t *) |
| Agnode_t * | clone_vn (Agraph_t *, Agnode_t *) |
| void | cluster_leader (Agraph_t *) |
| void | collapse_cluster (Agraph_t *, Agraph_t *) |
| void | collapse_leaves (Agraph_t *) |
| void | collapse_rankset (Agraph_t *, Agraph_t *, int) |
| void | collapse_sets (Agraph_t *) |
| void | decompose (Agraph_t *, int) |
| void | delete_fast_edge (Agedge_t *) |
| void | delete_fast_node (Agraph_t *, Agnode_t *) |
| void | delete_flat_edge (Agedge_t *) |
| void | delete_other_edge (Agedge_t *) |
| void | dfs (Agnode_t *) |
| void | do_ordering (Agraph_t *, int) |
| void | dot_cleanup (graph_t *g) |
| void | dot_cleanup_edge (edge_t *e) |
| void | dot_cleanup_graph (graph_t *g) |
| void | dot_cleanup_node (node_t *n) |
| void | dot_free_splines (edge_t *e) |
| void | dot_init_node_edge (Agraph_t *) |
| void | dot_init_edge (Agedge_t *) |
| void | dot_init_node (Agnode_t *) |
| void | dot_layout (Agraph_t *g) |
| void | dot_init_graph (graph_t *g) |
| void | edgelabel_ranks (Agraph_t *) |
| void | end_component (void) |
| void | exchange (Agnode_t *, Agnode_t *) |
| void | expand_cluster (Agraph_t *) |
| void | expand_ranksets (Agraph_t *) |
| Agedge_t * | fast_edge (Agedge_t *) |
| void | fast_node (Agraph_t *, Agnode_t *) |
| void | fast_nodeapp (Agnode_t *, Agnode_t *) |
| void | find_clusters (Agraph_t *) |
| Agedge_t * | find_fast_edge (Agnode_t *, Agnode_t *) |
| Agnode_t * | find_fast_node (Agraph_t *, Agnode_t *) |
| Agedge_t * | find_flat_edge (Agnode_t *, Agnode_t *) |
| void | flat_edge (Agraph_t *, Agedge_t *) |
| int | flat_edges (Agraph_t *) |
| int | flat_mval (Agnode_t *) |
| int | in_cross (Agnode_t *, Agnode_t *) |
| void | incr_width (Agraph_t *, Agnode_t *) |
| int | inside_cluster (Agraph_t *, Agnode_t *) |
| void | install_cluster (Agraph_t *, Agnode_t *, int, queue *) |
| void | install_in_rank (Agraph_t *, Agnode_t *) |
| void | interclexp (Agraph_t *) |
| void | interclrep (Agraph_t *, Agedge_t *) |
| void | interclust1 (Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *) |
| int | is_a_normal_node_of (Agraph_t *, Agnode_t *) |
| int | is_a_vnode_of_an_edge_of (Agraph_t *, Agnode_t *) |
| int | is_cluster (Agraph_t *) |
| int | is_cluster_edge (Agedge_t *) |
| int | is_fast_node (Agraph_t *, Agnode_t *) |
| Agnode_t * | label_vnode (Agraph_t *, Agedge_t *) |
| Agnode_t * | leader_of (Agraph_t *, Agnode_t *) |
| int | left2right (Agraph_t *, Agnode_t *, Agnode_t *) |
| int | local_cross (elist, int) |
| void | dot_compoundEdges (Agraph_t *) |
| Agedge_t * | make_aux_edge (Agnode_t *, Agnode_t *, int, int) |
| void | make_chain (Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *) |
| void | make_interclust_chain (Agraph_t *, Agnode_t *, Agnode_t *, Agedge_t *) |
| int | make_new_cluster (Agraph_t *, Agraph_t *) |
| void | make_slots (Agraph_t *, int, int, int) |
| Agnode_t * | map_interclust_node (Agnode_t *) |
| void | map_path (Agnode_t *, Agnode_t *, Agedge_t *, Agedge_t *, int) |
| void | mark_clusters (Agraph_t *) |
| void | mark_lowclusters (Agraph_t *) |
| int | mergeable (edge_t *e, edge_t *f) |
| void | merge_chain (Agraph_t *, Agedge_t *, Agedge_t *, int) |
| void | merge_components (Agraph_t *) |
| Agnode_t * | merge_leaves (Agraph_t *, Agnode_t *, Agnode_t *) |
| void | merge_oneway (Agedge_t *, Agedge_t *) |
| void | merge_ranks (Agraph_t *) |
| void | minmax_edges (Agraph_t *) |
| int | ncross (Agraph_t *) |
| Agedge_t * | new_virtual_edge (Agnode_t *, Agnode_t *, Agedge_t *) |
| void | node_induce (Agraph_t *, Agraph_t *) |
| int | nonconstraint_edge (Agedge_t *) |
| int | ordercmpf (int *, int *) |
| void | ordered_edges (Agraph_t *) |
| void | other_edge (Agedge_t *) |
| int | out_cross (Agnode_t *, Agnode_t *) |
| Agnode_t * | plain_vnode (Agraph_t *, Agedge_t *) |
| int | portcmp (port p0, port p1) |
| void | potential_leaf (Agraph_t *, Agedge_t *, Agnode_t *) |
| int | ports_eq (edge_t *, edge_t *) |
| void | rank1 (Agraph_t *) |
| void | rank (Agraph_t *, int, int) |
| int | rank_set_class (Agraph_t *) |
| int | rcross (Agraph_t *, int) |
| void | rec_reset_vlists (Agraph_t *) |
| void | rec_save_vlists (Agraph_t *) |
| void | remove_rankleaders (Agraph_t *) |
| void | renewlist (elist *) |
| void | reorder (Agraph_t *, int, int, int) |
| void | reverse_edge (Agedge_t *) |
| void | safe_delete_fast_edge (Agedge_t *) |
| void | safe_list_append (Agedge_t *, elist *) |
| void | safe_other_edge (Agedge_t *) |
| void | save_vlist (Agraph_t *) |
| void | scan_ranks (Agraph_t *) |
| void | scan_result (void) |
| void | search_component (Agraph_t *, Agnode_t *) |
| void | set_minmax (Agraph_t *) |
| void | setup_page (Agraph_t *, point) |
| int | strccnt (char *, char) |
| void | transpose (Agraph_t *, int) |
| int | transpose_step (Agraph_t *, int, int) |
| void | unmerge_oneway (Agedge_t *) |
| void | update (Agedge_t *, Agedge_t *) |
| void | update_bb (Agraph_t *, point) |
| Agedge_t * | virtual_edge (Agnode_t *, Agnode_t *, Agedge_t *) |
| Agnode_t * | virtual_node (Agraph_t *) |
| void | virtual_weight (Agedge_t *) |
| void | zapinlist (elist *, Agedge_t *) |
| void | dot_nodesize (Agnode_t *, boolean) |
| void | dot_concentrate (Agraph_t *) |
| void | dot_mincross (Agraph_t *) |
| void | dot_position (Agraph_t *) |
| void | dot_rank (Agraph_t *) |
| void | dot_sameports (Agraph_t *) |
| void | dot_splines (Agraph_t *) |
