#include <limits.h>
#include "libgraph.h"
Include dependency graph for node.c:
Go to the source code of this file.
Functions | |
Agnode_t * | agfindnode (Agraph_t *g, char *name) |
Agnode_t * | agidnode (Agraph_t *g, int index) |
Agnode_t * | agnode (Agraph_t *g, char *name) |
void | agINSnode (Agraph_t *g, Agnode_t *n) |
void | agDELnode (Agraph_t *g, Agnode_t *n) |
Agnode_t * | agfstnode (Agraph_t *g) |
Agnode_t * | agnxtnode (Agraph_t *g, Agnode_t *n) |
Agnode_t * | aglstnode (Agraph_t *g) |
Agnode_t * | agprvnode (Agraph_t *g, Agnode_t *n) |
Agnode_t * | agNEWnode (Agraph_t *subg, char *name, Agnode_t *proto) |
void | agFREEnode (Agnode_t *n) |
Definition at line 68 of file node.c.
References AG_IS_METAGRAPH, agDELedge(), agDELnode(), agFREEnode(), agfstedge(), agfstout(), agnxtedge(), agnxtout(), agusergraph(), dtdelete, dtsearch, FALSE, Agnode_t::graph, Agedge_t::head, Agraph_t::meta_node, Agraph_t::nodes, and Agraph_t::root.
Referenced by agclose(), agdelete(), and agDELnode().
Definition at line 25 of file node.c.
References dtmatch, dtsearch, Agdata_t::node_dict, Agraph_t::nodes, Agraph_t::root, and Agraph_t::univ.
Referenced by agfindsubg(), agnode(), agsubg(), findnode(), main(), makeGraphs(), and twopi_layout().
void agFREEnode | ( | Agnode_t * | n | ) |
Definition at line 136 of file node.c.
References AG_IS_METAGRAPH, agdictof(), agstrfree(), Agnode_t::attr, Agdict_t::dict, Agnode_t::didset, dtdelete, dtsize(), FALSE, free(), Agnode_t::graph, Agnode_t::name, Agdata_t::node_dict, Agdata_t::nodeattr, TAG_OF, and Agraph_t::univ.
Referenced by agDELnode(), and agpopproto().
Definition at line 91 of file node.c.
References dtfirst, and Agraph_t::nodes.
Referenced by agclose(), allocate_ranks(), attach_attrs_and_arrows(), build_skeleton(), cAdjust(), ccomps(), circleLayout(), circo_cleanup(), circo_layout(), circomps(), circuit_model(), circularLayout(), class1(), class2(), compoundEdges(), compute_bb(), createBlocktree(), decompose(), dot_cleanup(), dot_compoundEdges(), dot_init_node_edge(), dot_sameports(), dot_scan_ranks(), dumpstat(), emit_clusters(), emit_graph(), expand_ranksets(), fdp_cleanup(), fdp_init_node_edge(), fdp_tLayout(), findCComp(), firstin(), firstnode(), firstout(), init_nop(), interclexp(), isConnected(), layout(), main(), mark_clusters(), mark_lowclusters(), neato_cleanup(), neato_init_node_edge(), neato_set_aspect(), nodeInduce(), normalize(), pccomps(), processClusterEdges(), scAdjust(), scan_graph_mode(), shortest_path(), spline_edges(), splineEdges(), twopi_cleanup(), twopi_layout(), undoClusterEdges(), and write_plain().
Definition at line 35 of file node.c.
References dtmatch, and Agraph_t::nodes.
Referenced by agcontains(), and agINSnode().
Definition at line 53 of file node.c.
References AG_IS_METAGRAPH, agfstin(), agidnode(), agINSnode(), agnxtin(), agusergraph(), dtinsert, FALSE, Agnode_t::graph, Agnode_t::id, Agraph_t::meta_node, Agraph_t::nodes, and Agedge_t::tail.
Referenced by aginsert(), agINSnode(), and agnode().
Definition at line 111 of file node.c.
References AG, agstrdup(), Agnode_t::attr, Agdict_t::dict, Agnode_t::didset, dtsize(), Agnode_t::graph, Agnode_t::id, Agdict_t::list, Agdata_t::max_node_id, N_NEW, Agnode_t::name, AG_s::node_nbytes, Agdata_t::nodeattr, NULL, Agraph_t::root, objstack_t::subg, Agnode_t::tag, TAG_NODE, Agraph_t::univ, and Agsym_t::value.
Referenced by agnode().
Definition at line 42 of file node.c.
References agfindnode(), agINSnode(), agNEWnode(), dtinsert, Agproto_t::n, Agdata_t::node_dict, NULL, Agraph_t::proto, Agraph_t::root, and Agraph_t::univ.
Referenced by agopen(), agsubg(), main(), makeGraphs(), and node().
Definition at line 96 of file node.c.
References dtnext, and Agraph_t::nodes.
Referenced by agclose(), allocate_ranks(), attach_attrs_and_arrows(), build_skeleton(), cAdjust(), ccomps(), circo_cleanup(), circomps(), circuit_model(), class1(), class2(), compoundEdges(), compute_bb(), createBlocktree(), decompose(), dot_cleanup(), dot_compoundEdges(), dot_init_node_edge(), dot_sameports(), dot_scan_ranks(), dumpstat(), emit_clusters(), emit_graph(), expand_ranksets(), fdp_cleanup(), fdp_init_node_edge(), fdp_tLayout(), findCComp(), init_nop(), interclexp(), isConnected(), layout(), main(), mark_clusters(), mark_lowclusters(), neato_cleanup(), neato_init_node_edge(), neato_set_aspect(), nextin(), nextnode(), nextout(), nodeInduce(), normalize(), pccomps(), processClusterEdges(), scAdjust(), scan_graph_mode(), shortest_path(), spline_edges(), splineEdges(), twopi_cleanup(), undoClusterEdges(), and write_plain().