Graphviz 13.0.0~dev.20241212.1010
Loading...
Searching...
No Matches
Collaboration diagram for nodes:

Files

file  node.c
 

Data Structures

struct  Agsubnode_s
 This is the node struct allocated per graph (or subgraph). More...
 
struct  Agnode_s
 
struct  Agnodeinfo_t
 

Macros

#define ND_id(n)   (((Agnodeinfo_t*)AGDATA(n))->id)
 
#define ND_alg(n)   (((Agnodeinfo_t*)AGDATA(n))->alg)
 
#define ND_UF_parent(n)   (((Agnodeinfo_t*)AGDATA(n))->UF_parent)
 
#define ND_set(n)   (((Agnodeinfo_t*)AGDATA(n))->set)
 
#define ND_UF_size(n)   (((Agnodeinfo_t*)AGDATA(n))->UF_size)
 
#define ND_bb(n)   (((Agnodeinfo_t*)AGDATA(n))->bb)
 
#define ND_clust(n)   (((Agnodeinfo_t*)AGDATA(n))->clust)
 
#define ND_coord(n)   (((Agnodeinfo_t*)AGDATA(n))->coord)
 
#define ND_dist(n)   (((Agnodeinfo_t*)AGDATA(n))->dist)
 
#define ND_flat_in(n)   (((Agnodeinfo_t*)AGDATA(n))->flat_in)
 
#define ND_flat_out(n)   (((Agnodeinfo_t*)AGDATA(n))->flat_out)
 
#define ND_gui_state(n)   (((Agnodeinfo_t*)AGDATA(n))->gui_state)
 
#define ND_has_port(n)   (((Agnodeinfo_t*)AGDATA(n))->has_port)
 
#define ND_rep(n)   (((Agnodeinfo_t*)AGDATA(n))->rep)
 
#define ND_heapindex(n)   (((Agnodeinfo_t*)AGDATA(n))->heapindex)
 
#define ND_height(n)   (((Agnodeinfo_t*)AGDATA(n))->height)
 
#define ND_hops(n)   (((Agnodeinfo_t*)AGDATA(n))->hops)
 
#define ND_ht(n)   (((Agnodeinfo_t*)AGDATA(n))->ht)
 
#define ND_in(n)   (((Agnodeinfo_t*)AGDATA(n))->in)
 
#define ND_label(n)   (((Agnodeinfo_t*)AGDATA(n))->label)
 
#define ND_xlabel(n)   (((Agnodeinfo_t*)AGDATA(n))->xlabel)
 
#define ND_lim(n)   (((Agnodeinfo_t*)AGDATA(n))->lim)
 
#define ND_low(n)   (((Agnodeinfo_t*)AGDATA(n))->low)
 
#define ND_lw(n)   (((Agnodeinfo_t*)AGDATA(n))->lw)
 
#define ND_mark(n)   (((Agnodeinfo_t*)AGDATA(n))->mark)
 
#define ND_mval(n)   (((Agnodeinfo_t*)AGDATA(n))->mval)
 
#define ND_n_cluster(n)   (((Agnodeinfo_t*)AGDATA(n))->n_cluster)
 
#define ND_next(n)   (((Agnodeinfo_t*)AGDATA(n))->next)
 
#define ND_node_type(n)   (((Agnodeinfo_t*)AGDATA(n))->node_type)
 
#define ND_onstack(n)   (((Agnodeinfo_t*)AGDATA(n))->onstack)
 
#define ND_order(n)   (((Agnodeinfo_t*)AGDATA(n))->order)
 
#define ND_other(n)   (((Agnodeinfo_t*)AGDATA(n))->other)
 
#define ND_out(n)   (((Agnodeinfo_t*)AGDATA(n))->out)
 
#define ND_outline_width(n)   (((Agnodeinfo_t*)AGDATA(n))->outline_width)
 
#define ND_outline_height(n)   (((Agnodeinfo_t*)AGDATA(n))->outline_height)
 
#define ND_par(n)   (((Agnodeinfo_t*)AGDATA(n))->par)
 
#define ND_pinned(n)   (((Agnodeinfo_t*)AGDATA(n))->pinned)
 
#define ND_pos(n)   (((Agnodeinfo_t*)AGDATA(n))->pos)
 
#define ND_prev(n)   (((Agnodeinfo_t*)AGDATA(n))->prev)
 
#define ND_priority(n)   (((Agnodeinfo_t*)AGDATA(n))->priority)
 
#define ND_rank(n)   (((Agnodeinfo_t*)AGDATA(n))->rank)
 
#define ND_ranktype(n)   (((Agnodeinfo_t*)AGDATA(n))->ranktype)
 
#define ND_rw(n)   (((Agnodeinfo_t*)AGDATA(n))->rw)
 
#define ND_save_in(n)   (((Agnodeinfo_t*)AGDATA(n))->save_in)
 
#define ND_save_out(n)   (((Agnodeinfo_t*)AGDATA(n))->save_out)
 
#define ND_shape(n)   (((Agnodeinfo_t*)AGDATA(n))->shape)
 
#define ND_shape_info(n)   (((Agnodeinfo_t*)AGDATA(n))->shape_info)
 
#define ND_showboxes(n)   (((Agnodeinfo_t*)AGDATA(n))->showboxes)
 
#define ND_state(n)   (((Agnodeinfo_t*)AGDATA(n))->state)
 
#define ND_clustnode(n)   (((Agnodeinfo_t*)AGDATA(n))->clustnode)
 
#define ND_tree_in(n)   (((Agnodeinfo_t*)AGDATA(n))->tree_in)
 
#define ND_tree_out(n)   (((Agnodeinfo_t*)AGDATA(n))->tree_out)
 
#define ND_weight_class(n)   (((Agnodeinfo_t*)AGDATA(n))->weight_class)
 
#define ND_width(n)   (((Agnodeinfo_t*)AGDATA(n))->width)
 
#define ND_xsize(n)   (ND_lw(n)+ND_rw(n))
 
#define ND_ysize(n)   (ND_ht(n))
 
#define agfindnode(g, n)   (agnode(g,n,0))
 
#define agfindnodeattr(g, a)   (agattr(g,AGNODE,a,NULL))
 

Typedefs

typedef struct Agnode_s Agnode_t
 node (atom)
 
typedef struct Agsubnode_s Agsubnode_t
 
typedef struct Agnodeinfo_t Agnodeinfo_t
 

Functions

Agnode_tagnode (Agraph_t *g, char *name, int createflag)
 
Agnode_tagidnode (Agraph_t *g, IDTYPE id, int createflag)
 
Agnode_tagsubnode (Agraph_t *g, Agnode_t *n, int createflag)
 
Agnode_tagfstnode (Agraph_t *g)
 
Agnode_tagnxtnode (Agraph_t *g, Agnode_t *n)
 
Agnode_taglstnode (Agraph_t *g)
 
Agnode_tagprvnode (Agraph_t *g, Agnode_t *n)
 
Agsubnode_tagsubrep (Agraph_t *g, Agnode_t *n)
 
int agnodebefore (Agnode_t *u, Agnode_t *v)
 
int agdelnode (Agraph_t *g, Agnode_t *arg_n)
 removes a node from a graph or subgraph.
 
int agrelabel_node (Agnode_t *n, char *newname)
 

Detailed Description

A node is created by giving a unique string name or programmer defined integer ID, and is represented by a unique internal object. (Node equality can checked by pointer comparison.)

Macro Definition Documentation

◆ agfindnode

#define agfindnode (   g,
 
)    (agnode(g,n,0))

Definition at line 611 of file types.h.

◆ agfindnodeattr

#define agfindnodeattr (   g,
 
)    (agattr(g,AGNODE,a,NULL))

Definition at line 615 of file types.h.

◆ ND_alg

#define ND_alg (   n)    (((Agnodeinfo_t*)AGDATA(n))->alg)

Definition at line 484 of file types.h.

◆ ND_bb

#define ND_bb (   n)    (((Agnodeinfo_t*)AGDATA(n))->bb)

Definition at line 488 of file types.h.

◆ ND_clust

#define ND_clust (   n)    (((Agnodeinfo_t*)AGDATA(n))->clust)

Definition at line 489 of file types.h.

◆ ND_clustnode

#define ND_clustnode (   n)    (((Agnodeinfo_t*)AGDATA(n))->clustnode)

Definition at line 532 of file types.h.

◆ ND_coord

#define ND_coord (   n)    (((Agnodeinfo_t*)AGDATA(n))->coord)

Definition at line 490 of file types.h.

◆ ND_dist

#define ND_dist (   n)    (((Agnodeinfo_t*)AGDATA(n))->dist)

Definition at line 491 of file types.h.

◆ ND_flat_in

#define ND_flat_in (   n)    (((Agnodeinfo_t*)AGDATA(n))->flat_in)

Definition at line 492 of file types.h.

◆ ND_flat_out

#define ND_flat_out (   n)    (((Agnodeinfo_t*)AGDATA(n))->flat_out)

Definition at line 493 of file types.h.

◆ ND_gui_state

#define ND_gui_state (   n)    (((Agnodeinfo_t*)AGDATA(n))->gui_state)

Definition at line 494 of file types.h.

◆ ND_has_port

#define ND_has_port (   n)    (((Agnodeinfo_t*)AGDATA(n))->has_port)

Definition at line 495 of file types.h.

◆ ND_heapindex

#define ND_heapindex (   n)    (((Agnodeinfo_t*)AGDATA(n))->heapindex)

Definition at line 497 of file types.h.

◆ ND_height

#define ND_height (   n)    (((Agnodeinfo_t*)AGDATA(n))->height)

Definition at line 498 of file types.h.

◆ ND_hops

#define ND_hops (   n)    (((Agnodeinfo_t*)AGDATA(n))->hops)

Definition at line 499 of file types.h.

◆ ND_ht

#define ND_ht (   n)    (((Agnodeinfo_t*)AGDATA(n))->ht)

Definition at line 500 of file types.h.

◆ ND_id

#define ND_id (   n)    (((Agnodeinfo_t*)AGDATA(n))->id)

Definition at line 483 of file types.h.

◆ ND_in

#define ND_in (   n)    (((Agnodeinfo_t*)AGDATA(n))->in)

Definition at line 501 of file types.h.

◆ ND_label

#define ND_label (   n)    (((Agnodeinfo_t*)AGDATA(n))->label)

Definition at line 502 of file types.h.

◆ ND_lim

#define ND_lim (   n)    (((Agnodeinfo_t*)AGDATA(n))->lim)

Definition at line 504 of file types.h.

◆ ND_low

#define ND_low (   n)    (((Agnodeinfo_t*)AGDATA(n))->low)

Definition at line 505 of file types.h.

◆ ND_lw

#define ND_lw (   n)    (((Agnodeinfo_t*)AGDATA(n))->lw)

Definition at line 506 of file types.h.

◆ ND_mark

#define ND_mark (   n)    (((Agnodeinfo_t*)AGDATA(n))->mark)

Definition at line 507 of file types.h.

◆ ND_mval

#define ND_mval (   n)    (((Agnodeinfo_t*)AGDATA(n))->mval)

Definition at line 508 of file types.h.

◆ ND_n_cluster

#define ND_n_cluster (   n)    (((Agnodeinfo_t*)AGDATA(n))->n_cluster)

Definition at line 509 of file types.h.

◆ ND_next

#define ND_next (   n)    (((Agnodeinfo_t*)AGDATA(n))->next)

Definition at line 510 of file types.h.

◆ ND_node_type

#define ND_node_type (   n)    (((Agnodeinfo_t*)AGDATA(n))->node_type)

Definition at line 511 of file types.h.

◆ ND_onstack

#define ND_onstack (   n)    (((Agnodeinfo_t*)AGDATA(n))->onstack)

Definition at line 512 of file types.h.

◆ ND_order

#define ND_order (   n)    (((Agnodeinfo_t*)AGDATA(n))->order)

Definition at line 513 of file types.h.

◆ ND_other

#define ND_other (   n)    (((Agnodeinfo_t*)AGDATA(n))->other)

Definition at line 514 of file types.h.

◆ ND_out

#define ND_out (   n)    (((Agnodeinfo_t*)AGDATA(n))->out)

Definition at line 515 of file types.h.

◆ ND_outline_height

#define ND_outline_height (   n)    (((Agnodeinfo_t*)AGDATA(n))->outline_height)

Definition at line 517 of file types.h.

◆ ND_outline_width

#define ND_outline_width (   n)    (((Agnodeinfo_t*)AGDATA(n))->outline_width)

Definition at line 516 of file types.h.

◆ ND_par

#define ND_par (   n)    (((Agnodeinfo_t*)AGDATA(n))->par)

Definition at line 518 of file types.h.

◆ ND_pinned

#define ND_pinned (   n)    (((Agnodeinfo_t*)AGDATA(n))->pinned)

Definition at line 519 of file types.h.

◆ ND_pos

#define ND_pos (   n)    (((Agnodeinfo_t*)AGDATA(n))->pos)

Definition at line 520 of file types.h.

◆ ND_prev

#define ND_prev (   n)    (((Agnodeinfo_t*)AGDATA(n))->prev)

Definition at line 521 of file types.h.

◆ ND_priority

#define ND_priority (   n)    (((Agnodeinfo_t*)AGDATA(n))->priority)

Definition at line 522 of file types.h.

◆ ND_rank

#define ND_rank (   n)    (((Agnodeinfo_t*)AGDATA(n))->rank)

Definition at line 523 of file types.h.

◆ ND_ranktype

#define ND_ranktype (   n)    (((Agnodeinfo_t*)AGDATA(n))->ranktype)

Definition at line 524 of file types.h.

◆ ND_rep

#define ND_rep (   n)    (((Agnodeinfo_t*)AGDATA(n))->rep)

Definition at line 496 of file types.h.

◆ ND_rw

#define ND_rw (   n)    (((Agnodeinfo_t*)AGDATA(n))->rw)

Definition at line 525 of file types.h.

◆ ND_save_in

#define ND_save_in (   n)    (((Agnodeinfo_t*)AGDATA(n))->save_in)

Definition at line 526 of file types.h.

◆ ND_save_out

#define ND_save_out (   n)    (((Agnodeinfo_t*)AGDATA(n))->save_out)

Definition at line 527 of file types.h.

◆ ND_set

#define ND_set (   n)    (((Agnodeinfo_t*)AGDATA(n))->set)

Definition at line 486 of file types.h.

◆ ND_shape

#define ND_shape (   n)    (((Agnodeinfo_t*)AGDATA(n))->shape)

Definition at line 528 of file types.h.

◆ ND_shape_info

#define ND_shape_info (   n)    (((Agnodeinfo_t*)AGDATA(n))->shape_info)

Definition at line 529 of file types.h.

◆ ND_showboxes

#define ND_showboxes (   n)    (((Agnodeinfo_t*)AGDATA(n))->showboxes)

Definition at line 530 of file types.h.

◆ ND_state

#define ND_state (   n)    (((Agnodeinfo_t*)AGDATA(n))->state)

Definition at line 531 of file types.h.

◆ ND_tree_in

#define ND_tree_in (   n)    (((Agnodeinfo_t*)AGDATA(n))->tree_in)

Definition at line 533 of file types.h.

◆ ND_tree_out

#define ND_tree_out (   n)    (((Agnodeinfo_t*)AGDATA(n))->tree_out)

Definition at line 534 of file types.h.

◆ ND_UF_parent

#define ND_UF_parent (   n)    (((Agnodeinfo_t*)AGDATA(n))->UF_parent)

Definition at line 485 of file types.h.

◆ ND_UF_size

#define ND_UF_size (   n)    (((Agnodeinfo_t*)AGDATA(n))->UF_size)

Definition at line 487 of file types.h.

◆ ND_weight_class

#define ND_weight_class (   n)    (((Agnodeinfo_t*)AGDATA(n))->weight_class)

Definition at line 535 of file types.h.

◆ ND_width

#define ND_width (   n)    (((Agnodeinfo_t*)AGDATA(n))->width)

Definition at line 536 of file types.h.

◆ ND_xlabel

#define ND_xlabel (   n)    (((Agnodeinfo_t*)AGDATA(n))->xlabel)

Definition at line 503 of file types.h.

◆ ND_xsize

#define ND_xsize (   n)    (ND_lw(n)+ND_rw(n))

Definition at line 537 of file types.h.

◆ ND_ysize

#define ND_ysize (   n)    (ND_ht(n))

Definition at line 538 of file types.h.

Typedef Documentation

◆ Agnode_t

typedef struct Agnode_s Agnode_t

Definition at line 86 of file cgraph.h.

◆ Agnodeinfo_t

typedef struct Agnodeinfo_t Agnodeinfo_t

◆ Agsubnode_t

typedef struct Agsubnode_s Agsubnode_t

Definition at line 87 of file cgraph.h.

Function Documentation

◆ agdelnode()

int agdelnode ( Agraph_t g,
Agnode_t arg_n 
)

Definition at line 197 of file node.c.

References agapply(), agdeledge(), agdelnodeimage(), agfindnode_by_id(), agfree(), agfreeid(), agfstedge(), AGID, agmethod_delete(), AGNODE, agnodeattr_delete(), agnxtedge(), agrecclose(), agroot(), Agraph_s::desc, FAILURE, Agdesc_s::has_attrs, NULL, and SUCCESS.

Referenced by agclose(), agdelete(), emptyComp(), removeFill(), and topsort().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ agfstnode()

Agnode_t * agfstnode ( Agraph_t g)

Definition at line 40 of file node.c.

References dtfirst, Agraph_s::n_seq, Agsubnode_s::node, and NULL.

Referenced by _neato_set_aspect(), add_fast_edges(), addCutPts(), addGraphObjs(), addXLabels(), addZ(), adjust(), adjust(), agclean(), agclose(), aginit(), agnedges(), allocate_ranks(), applyDelta(), attach_attrs_and_arrows(), attach_edge_colors(), attach_phase_attrs(), attached_clustering(), attachPos(), block_graph(), break_cycles(), build_skeleton(), bundle(), cAdjust(), cc_decompose(), cccomps(), ccomps(), checkG(), checkG(), circleLayout(), circo_cleanup(), circo_layout(), circomps(), circuit_model(), circular_init_node_edge(), circularLayout(), class1(), class2(), cleanup1(), clone_graph(), cloneGraph(), cloneGraph(), cloneSubg(), cloneSubg(), closeDerivedGraph(), closeGraph(), clust_in_layer(), cluster_init_graph(), cluster_leader(), cntOverlaps(), collapse_cluster(), collapse_rankset(), color(), compile_clusters(), compile_edges(), compile_nodes(), compile_samerank(), compOf(), compoundEdges(), compute_bb(), connect_components(), constrainY(), copyPosns(), count_all_crossings(), countComponents(), create_save_subgraph_from_filter(), createBlocktree(), createOneBlock(), decompose(), deleteGraphNodes(), deriveClusters(), deriveGraph(), deriveGraph(), deselect_all(), do_ordering(), do_ordering_for_nodes(), doApply(), doCleanup(), dot_cleanup(), dot_compoundEdges(), dot_init_node_edge(), dot_mincross(), dot_sameports(), dot_scan_ranks(), Dot_SetClusterColor(), dot_splines_(), edge_normalize(), edgelabel_ranks(), edgerhs(), edgerhs(), emit_clusters(), emit_colors(), emit_graph(), emit_view(), emptyComp(), endedge(), endedge(), evalPositions(), expand_ranksets(), export_dot(), extract_adjacency(), fdp_cleanup(), fdp_init_node_edge(), fdp_tLayout(), finalCC(), find_all_cycles(), find_blocks(), find_longest_path(), findCComp(), findCenterNode(), findRootNode(), findSource(), firstin(), firstnode(), firstout(), fixLabelOrder(), freeDerivedGraph(), freeEdgeInfo(), gAdjust(), genPoly(), getList(), getPos(), getRotation(), getSizes(), getval(), graphcmd_internal(), graphviz_acyclic(), graphviz_node_induce(), graphviz_tred(), graphviz_unflatten(), gv_to_gml(), gvevent_find_obj(), gvToolTred(), Import_coord_clusters_from_dot(), Import_dot_splines(), induceEdges(), init_all_attrs(), init_bb(), init_graph(), init_node_edge(), init_nop(), initGraphAttrs(), initLayout(), initPositions(), initRegular(), interclexp(), is_empty(), isConnected(), iterateBody(), layout(), layout(), majorization(), makeDotGraph(), makeGraph(), makeGraphData(), makeInfo(), makeMatrix(), mapGraphs(), mark_clusters(), mark_lowcluster_basic(), mark_lowclusters(), mds_model(), minmax_edges2(), mkMaze(), mkTree(), neato_cleanup(), neato_init_node_edge(), neato_set_aspect(), neato_translate(), nextNode(), node_induce(), nodeInduce(), nop_init_edges(), normalize(), orthoEdges(), osage_cleanup(), osage_layout(), patchwork_cleanup(), patchwork_init_node_edge(), pccomps(), pick_object(), pick_objects_in_rect(), place_residual_nodes(), populate_data(), post(), prepare_topological_fisheye(), process(), process(), process(), processClusterEdges(), processClusters(), projectG(), readout_levels(), realFillRanks(), rebuild_vlists(), reduce(), removeFill(), renderEdgeLabels(), renderEdgesFn(), renderNodeLabels(), renderNodes(), renderSelectedEdges(), renderSelectedNodes(), reposition(), resetCoord(), resetRW(), scAdjust(), scan_graph_mode(), select_polygon(), set_attrwf(), set_attrwf(), set_boundaries(), set_header_text(), set_visibility(), setAbsolutePos(), setattr(), setClustNodes(), setMinMax(), setParentNodes(), setSubtreeSize(), sfdp_cleanup(), sfdp_init_node_edge(), sfdpLayout(), shiftGraphs(), shortest_path(), simpleScale(), spanning_tree(), SparseMatrix_import_dot(), spline_edges(), spline_edges_(), splineEdges(), translate_drawing(), travEdges(), travFlat(), travNodes(), twopi_cleanup(), twopi_init_node_edge(), twopi_layout(), undoClusterEdges(), union_all(), unionNodes(), updatePos(), updateSmGraph(), write_body(), write_edges(), write_graph(), write_nodes(), write_plain(), and writeBody().

◆ agidnode()

Agnode_t * agidnode ( Agraph_t g,
IDTYPE  id,
int  createflag 
)

Definition at line 124 of file node.c.

References agallocid(), agfindnode_by_id(), agnextseq(), AGNODE, agroot(), agsubnode(), initnode(), installnodetoroot(), newnode(), and NULL.

Referenced by agcontains(), cc_dfs(), compOf(), and writeBody().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ aglstnode()

Agnode_t * aglstnode ( Agraph_t g)

Definition at line 55 of file node.c.

References dtlast, Agraph_s::n_seq, Agsubnode_s::node, and NULL.

Referenced by graphcmd_internal(), and gvevent_find_obj().

Here is the caller graph for this function:

◆ agnode()

Agnode_t * agnode ( Agraph_t g,
char *  name,
int  createflag 
)

Definition at line 147 of file node.c.

References agfindnode_by_id(), agmapnametoid(), agnextseq(), AGNODE, agregister(), agroot(), agsubnode(), agsubrep(), id, initnode(), installnodetoroot(), newnode(), and NULL.

Referenced by addCutPts(), appendnode(), appendnode(), checkLabelOrder(), clone_graph(), cloneGraph(), cloneNode(), cloneSubg(), clustNode(), deriveClusters(), deriveGraph(), findnode(), getval(), graphcmd_internal(), gvplugin_graph(), main(), main(), makeDerivedNode(), makeDotGraph(), makeXnode(), mapN(), mkConstraintG(), mkDeriveNode(), mkGraph(), mkGraph(), mkNConstraintG(), node(), openNode(), realFillRanks(), and visit().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ agnodebefore()

int agnodebefore ( Agnode_t u,
Agnode_t v 
)

Definition at line 334 of file node.c.

References agapply(), AGNODE, agnoderenew(), agnodesetfinger(), agprvnode(), agroot(), AGSEQ, Agraph_s::clos, FAILURE, Agclos_s::seq, SEQ_MASK, and SUCCESS.

Here is the call graph for this function:

◆ agnxtnode()

Agnode_t * agnxtnode ( Agraph_t g,
Agnode_t n 
)

Definition at line 47 of file node.c.

References agsubrep(), dtnext, Agraph_s::n_seq, Agsubnode_s::node, and NULL.

Referenced by _neato_set_aspect(), add_fast_edges(), addCutPts(), addGraphObjs(), addXLabels(), addZ(), adjust(), adjust(), agclean(), agclose(), aginit(), agnedges(), allocate_ranks(), applyDelta(), attach_attrs_and_arrows(), attach_edge_colors(), attach_phase_attrs(), attached_clustering(), attachPos(), block_graph(), break_cycles(), build_skeleton(), bundle(), cAdjust(), cc_decompose(), cccomps(), ccomps(), checkG(), checkG(), circo_cleanup(), circomps(), circuit_model(), circular_init_node_edge(), class1(), class2(), cleanup1(), clone_graph(), cloneGraph(), cloneGraph(), cloneSubg(), cloneSubg(), closeDerivedGraph(), closeGraph(), clust_in_layer(), cluster_init_graph(), cluster_leader(), cntOverlaps(), collapse_rankset(), color(), compile_clusters(), compile_edges(), compile_nodes(), compile_samerank(), compOf(), compoundEdges(), compute_bb(), connect_components(), constrainY(), copyPosns(), count_all_crossings(), countComponents(), create_save_subgraph_from_filter(), createBlocktree(), createOneBlock(), decompose(), deleteGraphNodes(), deriveClusters(), deriveGraph(), deriveGraph(), deselect_all(), do_ordering(), do_ordering_for_nodes(), doApply(), doCleanup(), dot_cleanup(), dot_compoundEdges(), dot_init_node_edge(), dot_sameports(), dot_scan_ranks(), Dot_SetClusterColor(), dot_splines_(), edge_normalize(), edgelabel_ranks(), edgerhs(), edgerhs(), emit_clusters(), emit_colors(), emit_graph(), emit_view(), emptyComp(), endedge(), endedge(), evalPositions(), expand_ranksets(), export_dot(), extract_adjacency(), fdp_cleanup(), fdp_init_node_edge(), fdp_tLayout(), finalCC(), find_all_cycles(), find_blocks(), find_longest_path(), findCComp(), findCenterNode(), findRootNode(), findSource(), firstout(), fixLabelOrder(), freeDerivedGraph(), freeEdgeInfo(), gAdjust(), genPoly(), getList(), getPos(), getRotation(), getSizes(), getval(), graphcmd_internal(), graphviz_acyclic(), graphviz_node_induce(), graphviz_tred(), graphviz_unflatten(), gv_to_gml(), gvevent_find_obj(), gvToolTred(), Import_coord_clusters_from_dot(), Import_dot_splines(), induceEdges(), init_all_attrs(), init_bb(), init_graph(), init_node_edge(), init_nop(), initLayout(), initPositions(), initRegular(), interclexp(), isConnected(), iterateBody(), layout(), layout(), majorization(), makeDotGraph(), makeGraph(), makeGraphData(), makeInfo(), makeMatrix(), mapGraphs(), mark_clusters(), mark_lowcluster_basic(), mark_lowclusters(), mds_model(), minmax_edges2(), mkMaze(), mkTree(), neato_cleanup(), neato_init_node_edge(), neato_set_aspect(), neato_translate(), nextin(), nextnode(), nextNode(), nextout(), node_induce(), nodeInduce(), nop_init_edges(), normalize(), orthoEdges(), osage_cleanup(), osage_layout(), patchwork_cleanup(), patchwork_init_node_edge(), pccomps(), pick_object(), pick_objects_in_rect(), place_residual_nodes(), populate_data(), post(), prepare_topological_fisheye(), process(), process(), process(), processClusterEdges(), processClusters(), projectG(), prune(), readout_levels(), realFillRanks(), rebuild_vlists(), reduce(), removeFill(), renderEdgeLabels(), renderEdgesFn(), renderNodeLabels(), renderNodes(), renderSelectedEdges(), renderSelectedNodes(), reposition(), resetCoord(), resetRW(), scAdjust(), scan_graph_mode(), select_polygon(), set_attrwf(), set_attrwf(), set_boundaries(), set_header_text(), set_visibility(), setAbsolutePos(), setattr(), setClustNodes(), setMinMax(), setParentNodes(), setSubtreeSize(), sfdp_cleanup(), sfdp_init_node_edge(), sfdpLayout(), shiftGraphs(), shortest_path(), simpleScale(), spanning_tree(), SparseMatrix_import_dot(), spline_edges(), spline_edges_(), splineEdges(), translate_drawing(), travEdges(), travFlat(), travNodes(), twopi_cleanup(), twopi_init_node_edge(), undoClusterEdges(), union_all(), unionNodes(), updatePos(), updateSmGraph(), write_body(), write_edges(), write_graph(), write_nodes(), write_plain(), and writeBody().

Here is the call graph for this function:

◆ agprvnode()

Agnode_t * agprvnode ( Agraph_t g,
Agnode_t n 
)

Definition at line 62 of file node.c.

References agsubrep(), dtprev, Agraph_s::n_seq, Agsubnode_s::node, and NULL.

Referenced by agnodebefore(), graphcmd_internal(), and gvevent_find_obj().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ agrelabel_node()

int agrelabel_node ( Agnode_t n,
char *  newname 
)

Definition at line 239 of file node.c.

References agapply(), agfindnode_by_id(), agfindnode_by_name(), agfreeid(), AGID, agmapnametoid(), AGNODE, agraphof(), agroot(), dict_relabel(), FAILURE, NULL, and SUCCESS.

Referenced by agrename().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ agsubnode()

Agnode_t * agsubnode ( Agraph_t g,
Agnode_t n,
int  createflag 
)

Definition at line 261 of file node.c.

References agfindnode_by_id(), AGID, agparent(), agsubnode(), installnode(), NULL, Agnode_s::root, and Agraph_s::root.

Referenced by addNode(), addNode(), agidnode(), agnode(), agsubedge(), agsubnode(), clone_graph(), cloneSubg(), cloneSubg(), clustNode(), create_save_subgraph_from_filter(), createOneBlock(), dfs(), dfs(), dfs(), edgerhs(), edgerhs(), endedge(), endedge(), evalNode(), getComp(), graphviz_node_induce(), induceEdges(), insertFn(), mapN(), newedge(), node_in_subg(), nodeInduce(), projectG(), realFillRanks(), spanning_tree(), subnode_search(), unionNodes(), and visit().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ agsubrep()

Agsubnode_t * agsubrep ( Agraph_t g,
Agnode_t n 
)

Definition at line 144 of file edge.c.

References Agnode_s::base, Agtag_s::id, Agnode_s::mainsub, Agraph_s::n_id, node_set_find(), Agnode_s::root, and Agobj_s::tag.

Referenced by agcountuniqedges(), agdegree(), agdeledgeimage(), agfindedge_by_key(), agfstin(), agfstout(), agnode(), agnxtin(), agnxtnode(), agnxtout(), agprvnode(), dict_relabel(), and installedge().

Here is the call graph for this function:
Here is the caller graph for this function: