Agedge_t Struct Reference

#include <graph.h>

Collaboration diagram for Agedge_t:

[legend]

Data Fields
int	tag:4
int	printkey:4
int	handle:24
char **	attr
char *	didset
Agnode_t *	head
Agnode_t *	tail
int	id
Agedgeinfo_t	u

---

Detailed Description

Definition at line 90 of file graph.h.

---

Field Documentation

int Agedge_t::tag

Definition at line 91 of file graph.h.

Referenced by agNEWedge().

int Agedge_t::printkey

Definition at line 92 of file graph.h.

Referenced by agedge(), agINSedge(), and agwredge().

int Agedge_t::handle

Definition at line 93 of file graph.h.

char** Agedge_t::attr

Definition at line 94 of file graph.h.

Referenced by agedge(), agFREEedge(), agfstin(), agfstout(), agNEWedge(), agwredge(), and write_plain().

char* Agedge_t::didset

Definition at line 95 of file graph.h.

Referenced by agFREEedge(), and agNEWedge().

Agnode_t* Agedge_t::head

Definition at line 96 of file graph.h.

Referenced by agclose(), agcmpin(), agcmpout(), agDELedge(), agDELnode(), agedge(), agfstin(), agfstout(), agNEWedge(), agnxtedge(), agnxtin(), agpopproto(), agwredge(), allocate_ranks(), arrow_flags(), build_ranks(), build_skeleton(), circomps(), circuit_model(), class1(), class2(), common_init_edge(), compoundEdges(), delete_fast_edge(), delete_flat_edge(), dot_sameports(), dumpstat(), endpath(), enqueue_neighbors(), fast_edge(), findCComp(), firsthead(), firstsubg(), flat_edge(), flat_edges(), getPath(), headof(), interclexp(), main(), make_aux_edge(), makeSelfEdge(), makeSpline(), mark_clusters(), mark_lowclusters(), merge_chain(), mergeable(), neato_layout(), new_virtual_edge(), nexthead(), nextin(), nextnode(), nextsubg(), nodeInduce(), normalize(), reverse_edge(), rm(), s1(), selfRightSpace(), unmerge_oneway(), virtual_weight(), and write_plain().

Agnode_t * Agedge_t::tail

Definition at line 96 of file graph.h.

Referenced by agcmpin(), agcmpout(), agedge(), agFREEedge(), agfstin(), agfstout(), agINSnode(), agNEWedge(), agnxtedge(), agnxtout(), agpopproto(), agwredge(), allocate_ranks(), arrow_flags(), beginpath(), build_ranks(), build_skeleton(), circomps(), circuit_model(), class1(), class2(), clip_and_install(), common_init_edge(), delete_fast_edge(), delete_flat_edge(), dot_sameports(), enqueue_neighbors(), fast_edge(), firstattr(), firstnode(), firstsupg(), firsttail(), flat_edge(), flat_edges(), getPath(), getv(), graphof(), interclexp(), make_aux_edge(), makeSelfArcs(), makeSelfEdge(), makeSpline(), merge_chain(), mergeable(), new_virtual_edge(), nextattr(), nextnode(), nextout(), nextsupg(), nexttail(), normalize(), other_edge(), reverse_edge(), rm(), s1(), safe_other_edge(), setv(), tailof(), virtual_weight(), and write_plain().

int Agedge_t::id

Definition at line 97 of file graph.h.

Referenced by agNEWedge(), and new_virtual_edge().

Agedgeinfo_t Agedge_t::u

Definition at line 98 of file graph.h.

Referenced by gv_cleanup_edge(), mark_clusters(), and mark_lowclusters().

---

The documentation for this struct was generated from the following file:

• lib/graph/graph.h