This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
void acyclic | ( | Agraph_t * | ) |
void allocate_ranks | ( | Agraph_t * | ) |
Definition at line 790 of file mincross.c.
References agfstnode(), agfstout(), agnxtnode(), agnxtout(), free(), GD_maxrank, GD_minrank, GD_rank, Agedge_t::head, N_NEW, ND_rank, and Agedge_t::tail.
Referenced by expand_cluster().
void build_ranks | ( | Agraph_t * | , | |
int | ||||
) |
Definition at line 859 of file mincross.c.
References agerr(), AGERR, assert, CLUSTER, dequeue(), enqueue(), enqueue_neighbors(), exchange, FALSE, free_queue(), GD_flip, GD_maxrank, GD_minrank, GD_n_nodes, GD_nlist, GD_rank, Agedge_t::head, install_cluster(), install_in_rank(), MARK, ncross(), ND_in, ND_next, ND_out, ND_ranktype, new_queue(), NULL, Agraph_t::root, Agedge_t::tail, and TRUE.
Referenced by expand_cluster().
Definition at line 341 of file cluster.c.
References agfstnode(), agfstout(), agnxtnode(), agnxtout(), CL_CROSS, CLUSTER, ED_count, ED_xpenalty, GD_maxrank, GD_minrank, GD_rankleader, Agedge_t::head, N_NEW, ND_clust, ND_out, ND_rank, ND_ranktype, ND_UF_size, NULL, Agedge_t::tail, virtual_edge(), and virtual_node().
Referenced by class2().
void class1 | ( | Agraph_t * | ) |
Definition at line 69 of file class1.c.
References agfindedge(), agfstnode(), agfstout(), agnxtnode(), agnxtout(), ED_to_virt, find_fast_edge(), mark_clusters(), merge_oneway(), ND_clust, nonconstraint_edge(), NULL, UF_find(), and virtual_edge().
Referenced by dot_rank().
void class2 | ( | Agraph_t * | ) |
Definition at line 176 of file class2.c.
References agfindedge(), agfstnode(), agfstout(), agnxtnode(), agnxtout(), ALLOC, build_skeleton(), Concentrate, ED_conc_opp_flag, ED_edge_type, ED_label, ED_to_virt, FALSE, fast_node(), flat_edge(), GD_clust, GD_comp, GD_n_cluster, GD_n_nodes, GD_nlist, Agedge_t::head, IGNORED, mark_clusters(), merge_chain(), merge_oneway(), mergeable(), ND_clust, ND_rank, ND_weight_class, NULL, other_edge(), ports_eq(), Agraph_t::root, Agedge_t::tail, TRUE, and UF_find().
Referenced by expand_cluster().
void decompose | ( | Agraph_t * | , | |
int | ||||
) |
Definition at line 90 of file decomp.c.
References agfstnode(), agnxtnode(), GD_comp, GD_n_nodes, GD_rankleader, ND_clust, ND_mark, ND_rank, and UF_find().
Referenced by dot_rank().
void delete_fast_edge | ( | Agedge_t * | ) |
Definition at line 118 of file fastgr.c.
References assert, Agedge_t::head, ND_in, ND_out, NULL, Agedge_t::tail, and zapinlist().
Referenced by reverse_edge().
void delete_flat_edge | ( | Agedge_t * | ) |
Definition at line 263 of file fastgr.c.
References assert, ED_to_orig, ED_to_virt, ND_flat_in, ND_flat_out, NULL, and zapinlist().
void dot_compoundEdges | ( | Agraph_t * | ) |
Definition at line 512 of file compound.c.
References agfstnode(), agfstout(), agnxtnode(), and agnxtout().
Referenced by dot_layout().
void dot_concentrate | ( | Agraph_t * | ) |
Definition at line 195 of file conc.c.
References DOWN, FALSE, GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, left, right, and UP.
Referenced by dot_position().
void dot_init_node_edge | ( | graph_t * | g | ) |
Definition at line 58 of file dotinit.c.
References agfstnode(), agfstout(), agnxtnode(), and agnxtout().
Referenced by dot_layout().
void dot_mincross | ( | Agraph_t * | ) |
Definition at line 75 of file mincross.c.
References agget(), GD_clust, GD_comp, GD_n_cluster, mapbool(), mark_lowclusters(), and TRUE.
Referenced by dot_layout().
void dot_position | ( | Agraph_t * | ) |
Definition at line 121 of file position.c.
References assert, Concentrate, dot_concentrate(), flat_edges(), GD_nlist, mark_lowclusters(), NULL, and rank().
Referenced by dot_layout().
void dot_rank | ( | Agraph_t * | ) |
Definition at line 461 of file rank.c.
References acyclic(), agfindattr(), class1(), decompose(), and expand_ranksets().
Referenced by dot_layout().
void dot_sameports | ( | Agraph_t * | ) |
Definition at line 38 of file sameport.c.
References agfindattr(), agfstedge(), agfstnode(), agnxtedge(), agnxtnode(), agxget(), Agproto_t::e, E_samehead, E_sametail, free_list, Agedge_t::head, Agsym_t::index, MAXSAME, Agraph_t::proto, and Agedge_t::tail.
Referenced by dot_layout().
void dot_scan_ranks | ( | graph_t * | g | ) |
Definition at line 199 of file rank.c.
References agfstnode(), agnxtnode(), GD_leader, GD_maxrank, GD_minrank, MAXSHORT, ND_rank, and NULL.
void dot_splines | ( | Agraph_t * | ) |
void expand_cluster | ( | Agraph_t * | ) |
Definition at line 283 of file cluster.c.
References allocate_ranks(), build_ranks(), class2(), GD_comp, GD_nlist, and interclexp().
Definition at line 77 of file fastgr.c.
References assert, elist_append, Agedge_t::head, ND_in, ND_out, and Agedge_t::tail.
Referenced by make_aux_edge(), and virtual_edge().
Definition at line 60 of file fastgr.c.
References ND_flat_in, and ND_flat_out.
Referenced by interclexp().
Definition at line 256 of file fastgr.c.
References elist_append, GD_has_flat_edges, Agedge_t::head, ND_flat_in, ND_flat_out, Agraph_t::root, Agedge_t::tail, and TRUE.
Referenced by class2(), and interclexp().
int flat_edges | ( | Agraph_t * | ) |
Definition at line 257 of file flat.c.
References ED_adjacent, ED_dist, ED_label, ED_to_virt, FALSE, GD_flip, GD_n_cluster, GD_nlist, GD_rank, Agedge_t::head, le, MAX, ND_flat_in, ND_flat_out, ND_next, ND_other, ND_rank, rec_reset_vlists(), rec_save_vlists(), Agedge_t::tail, and TRUE.
Referenced by dot_position().
Definition at line 378 of file cluster.c.
References enqueue_neighbors(), GD_installed, GD_maxrank, GD_minrank, GD_rankleader, install_in_rank(), and ND_clust.
Referenced by build_ranks().
Definition at line 820 of file mincross.c.
References agerr(), AGERR, assert, GD_maxrank, GD_minrank, GD_nlist, GD_rank, Agraph_t::name, Agnode_t::name, ND_next, ND_order, ND_rank, and NULL.
Referenced by build_ranks(), and install_cluster().
int is_cluster | ( | Agraph_t * | ) |
Definition at line 173 of file position.c.
References ED_minlen, ED_weight, fast_edge(), Agedge_t::head, NEW, and Agedge_t::tail.
void mark_clusters | ( | Agraph_t * | ) |
Definition at line 299 of file cluster.c.
References agerr(), agfstnode(), agfstout(), agnxtnode(), agnxtout(), AGWARN, CLUSTER, ED_to_virt, GD_clust, GD_leader, GD_n_cluster, Agedge_t::head, Agraph_t::name, ND_clust, ND_out, ND_ranktype, NORMAL, NULL, Agedge_t::u, UF_setname(), UF_singleton(), and VIRTUAL.
void mark_lowclusters | ( | Agraph_t * | ) |
Definition at line 394 of file cluster.c.
References agfstnode(), agfstout(), agnxtnode(), agnxtout(), ED_to_virt, Agedge_t::head, ND_clust, ND_out, NULL, Agedge_t::u, and VIRTUAL.
Referenced by dot_mincross(), and dot_position().
Definition at line 147 of file class2.c.
References assert, ED_count, ED_to_virt, ED_weight, ED_xpenalty, Agedge_t::head, MAX, ND_out, ND_rank, NULL, and Agedge_t::tail.
Referenced by class2(), and interclexp().
Definition at line 330 of file fastgr.c.
References agerr(), AGWARN, assert, ED_to_virt, and NULL.
Referenced by class1(), class2(), interclexp(), and reverse_edge().
Definition at line 168 of file class2.c.
References ED_label, FALSE, Agedge_t::head, ports_eq(), Agedge_t::tail, and TRUE.
Referenced by class2(), and interclexp().
int ncross | ( | Agraph_t * | ) |
Definition at line 1199 of file mincross.c.
References GD_maxrank, GD_minrank, GD_rank, and TRUE.
Referenced by build_ranks().
Definition at line 165 of file fastgr.c.
References ED_count, ED_edge_type, ED_head_port, ED_minlen, ED_tail_port, ED_to_orig, ED_to_virt, ED_weight, ED_xpenalty, Agedge_t::head, Agedge_t::id, NEW, NULL, Agedge_t::tail, and VIRTUAL.
Referenced by virtual_edge().
int nonconstraint_edge | ( | Agedge_t * | ) |
void other_edge | ( | Agedge_t * | ) |
Definition at line 140 of file fastgr.c.
References elist_append, ND_other, and Agedge_t::tail.
Referenced by class2().
Definition at line 144 of file dotsplines.c.
References port::defined, FALSE, port::p, point::x, and point::y.
Definition at line 1107 of file position.c.
References ED_head_port, ED_tail_port, FALSE, point::x, and point::y.
Referenced by class2(), and mergeable().
void rec_reset_vlists | ( | Agraph_t * | ) |
Definition at line 655 of file mincross.c.
References assert, GD_clust, GD_maxrank, GD_minrank, GD_n_cluster, GD_rank, GD_rankleader, ND_order, ND_rank, rec_reset_vlists(), and Agraph_t::root.
Referenced by flat_edges(), and rec_reset_vlists().
void rec_save_vlists | ( | Agraph_t * | ) |
Definition at line 645 of file mincross.c.
References GD_clust, GD_n_cluster, rec_save_vlists(), and save_vlist().
Referenced by flat_edges(), and rec_save_vlists().
void reverse_edge | ( | Agedge_t * | ) |
Definition at line 24 of file acyclic.c.
References delete_fast_edge(), find_fast_edge(), Agedge_t::head, merge_oneway(), Agedge_t::tail, and virtual_edge().
void safe_other_edge | ( | Agedge_t * | ) |
Definition at line 145 of file fastgr.c.
References ND_other, and Agedge_t::tail.
Referenced by interclexp().
void save_vlist | ( | Agraph_t * | ) |
Definition at line 635 of file mincross.c.
References GD_maxrank, GD_minrank, GD_rank, and GD_rankleader.
Referenced by rec_save_vlists().
void unmerge_oneway | ( | Agedge_t * | ) |
Definition at line 349 of file fastgr.c.
References ED_count, ED_edge_type, ED_to_virt, Agedge_t::head, ND_node_type, ND_out, NULL, and VIRTUAL.
Definition at line 197 of file fastgr.c.
References fast_edge(), and new_virtual_edge().
Referenced by build_skeleton(), class1(), and reverse_edge().
Definition at line 238 of file fastgr.c.
References alloc_elist, fast_node(), GD_n_nodes, Agnode_t::graph, Agnode_t::name, ND_ht_i, ND_in, ND_lw_i, ND_node_type, ND_out, ND_rw_i, ND_UF_size, NEW, and VIRTUAL.
Referenced by build_skeleton().
void virtual_weight | ( | Agedge_t * | ) |
Definition at line 1360 of file mincross.c.
References ED_weight, Agedge_t::head, and Agedge_t::tail.
Definition at line 103 of file fastgr.c.
References elist::list, NULL, and elist::size.
Referenced by delete_fast_edge(), and delete_flat_edge().