Here is a list of all struct and union fields with links to the structures/unions they belong to:

- a -

• add : linklist
• add_edge : graph
• add_edge_sym : graph
• add_vertex : graph
• add_wedge : graph
• add_wedge_sym : graph
• alloc_count : mem_mamnager
• append : linklist
• assign : data_params , linklist

- b -

• bfs : graph
• block_size : memory_record
• build : heap

- c -

• cmpr : data_params , graph , heap , linklist , tree
• cmpr_idx : data_params , heap
• comp : bfs_info , dfs_info
• conn_comp : graph
• copy_idx : data_params , heap
• count : graph , heap , linklist , stack , t_queue , tree

- d -

• data : heap , llnode , stack , t_queue
• del : linklist , tree
• del_edge : graph
• del_edge_sym : graph
• del_idx : linklist
• del_vertex : graph
• deq : t_queue
• destroy : disjoint_set , graph , heap , linklist , stack , t_queue , tree
• dfs : graph
• dtype : linklist

- e -

• edge : dist_info
• empty : heap , stack , t_queue
• end_node : linklist
• enq : t_queue
• extract : heap

- f -

• file : memory_record
• find : disjoint_set , graph , linklist , tree
• free : data_params , graph , linklist , stack , t_queue , tree
• free_count : mem_mamnager
• front : t_queue
• full : heap , stack , t_queue

- g -

• get_idx : data_params , heap , linklist
• get_node_data : linklist

- h -

• has_edge : graph
• head : linklist
• head_node : linklist
• height : tree , tree_node

- i -

• id : gnode
• idx : gnode
• indegree : dag_info
• inorder : tree
• insert : heap , tree

- k -

• key : tree_node

- l -

• lchild : tree_node
• len : graph , heap , linklist , stack , t_queue
• level : bfs_info
• line : memory_record
• longest_path : dag_info

- m -

• make : disjoint_set
• max : tree
• max_size : graph , stack , t_queue
• mem : memory_record
• mem_record : mem_mamnager
• merge : disjoint_set
• min : tree

- n -

• name : disjoint_set , graph , heap , linklist , stack , t_queue , tree
• neigh : gnode
• next : memory_record
• next_node : linklist
• nmemb : memory_record
• node : dag_info , gedge
• node_count : tree
• nodes : graph
• nxt : llnode

- p -

• parent : bfs_info , dfs_info , dist_info , t_djset_node
• peek : stack , t_queue
• pop : stack
• post : dfs_info
• postorder : tree
• pre : dfs_info
• pred : tree
• preorder : tree
• prev_node : linklist
• print : disjoint_set , graph , heap , linklist , stack , t_queue , tree
• print_data : data_params , graph , heap , linklist , stack , t_queue , tree
• print_info : linklist
• prv : llnode
• push : stack

- r -

• rchild : tree_node
• rear : t_queue
• root : tree

- s -

• size : disjoint_set , heap , t_djset_node
• sort : heap
• subset : disjoint_set
• succ : tree
• swap : data_params , graph , linklist , tree
• swap_idx : data_params , heap

- t -

• tail : linklist
• tail_node : linklist
• top : stack
• topo_order_dag : graph
• total_edges : graph
• type : data_params , heap , linklist , stack , t_queue , tree

- u -

• update : heap

- v -

• visited_neighbors : dfs_info

- w -

• weight : gedge
• wprint : graph