C Everything
This is a C repository containing a curated set of generic data structures and algorithm.
graph Struct Reference

graph struct defn More...

#include <graph.h>

Data Fields

char * name
 Graph Instance Name. More...
 
int count
 Vertex Count of graph. More...
 
int max_size
 Max Vertex count of graph. More...
 
int total_edges
 Edge count of graph. More...
 
t_gnodenodes
 Adaceny List Representation of graph vertices. More...
 
f_gen2 add_vertex
 routine to add a vertex in graph More...
 
f_gen2 del_vertex
 routine to del a vertex in graph More...
 
f_gen3 add_edge
 routine to add an edge in graph More...
 
f_gen3 del_edge
 routine to del an edge in graph More...
 
f_gen3 add_edge_sym
 routine to add a symmetric edge in graph More...
 
f_gen3 del_edge_sym
 routine to del a symmetric edge in graph More...
 
f_wedge add_wedge
 routine to add a weighted edge in graph More...
 
f_wedge add_wedge_sym
 routine to add a weighted symmetric edge in graph More...
 
f_gen3 has_edge
 routine to check an edge between two vertices graph More...
 
f_gen2 bfs
 routine to Breadth First Search in graph More...
 
f_gen2 dfs
 routine to Depth First Search in graph More...
 
f_gen conn_comp
 routine to get the connected components in graph More...
 
f_gen topo_order_dag
 routine to topologica order a DAG More...
 
f_find find
 routine to find a vertex in graph More...
 
f_len len
 routine to get vertex count in graph More...
 
f_print print
 routine to print graph info More...
 
f_print wprint
 routine to print graph info with edge weights More...
 
f_destroy destroy
 routine to destroy the graph instance More...
 
f_cmpr cmpr
 
f_swap swap
 
f_free free
 
f_print print_data
 

Detailed Description

graph struct defn

Definition at line 26 of file graph.h.

Field Documentation

◆ add_edge

f_gen3 add_edge

routine to add an edge in graph

Definition at line 39 of file graph.h.

◆ add_edge_sym

f_gen3 add_edge_sym

routine to add a symmetric edge in graph

Definition at line 41 of file graph.h.

◆ add_vertex

f_gen2 add_vertex

routine to add a vertex in graph

Definition at line 37 of file graph.h.

◆ add_wedge

f_wedge add_wedge

routine to add a weighted edge in graph

Definition at line 43 of file graph.h.

◆ add_wedge_sym

f_wedge add_wedge_sym

routine to add a weighted symmetric edge in graph

Definition at line 44 of file graph.h.

◆ bfs

f_gen2 bfs

routine to Breadth First Search in graph

Definition at line 46 of file graph.h.

◆ cmpr

f_cmpr cmpr

Definition at line 57 of file graph.h.

◆ conn_comp

f_gen conn_comp

routine to get the connected components in graph

Definition at line 48 of file graph.h.

◆ count

int count

Vertex Count of graph.

Definition at line 29 of file graph.h.

◆ del_edge

f_gen3 del_edge

routine to del an edge in graph

Definition at line 40 of file graph.h.

◆ del_edge_sym

f_gen3 del_edge_sym

routine to del a symmetric edge in graph

Definition at line 42 of file graph.h.

◆ del_vertex

f_gen2 del_vertex

routine to del a vertex in graph

Definition at line 38 of file graph.h.

◆ destroy

f_destroy destroy

routine to destroy the graph instance

Definition at line 54 of file graph.h.

◆ dfs

f_gen2 dfs

routine to Depth First Search in graph

Definition at line 47 of file graph.h.

◆ find

f_find find

routine to find a vertex in graph

Definition at line 50 of file graph.h.

◆ free

f_free free

Definition at line 59 of file graph.h.

◆ has_edge

f_gen3 has_edge

routine to check an edge between two vertices graph

Definition at line 45 of file graph.h.

◆ len

f_len len

routine to get vertex count in graph

Definition at line 51 of file graph.h.

◆ max_size

int max_size

Max Vertex count of graph.

Definition at line 30 of file graph.h.

◆ name

char* name

Graph Instance Name.

Definition at line 28 of file graph.h.

◆ nodes

t_gnode* nodes

Adaceny List Representation of graph vertices.

Definition at line 34 of file graph.h.

◆ print

f_print print

routine to print graph info

Definition at line 52 of file graph.h.

◆ print_data

f_print print_data

Definition at line 60 of file graph.h.

◆ swap

f_swap swap

Definition at line 58 of file graph.h.

◆ topo_order_dag

f_gen topo_order_dag

routine to topologica order a DAG

Definition at line 49 of file graph.h.

◆ total_edges

int total_edges

Edge count of graph.

Definition at line 31 of file graph.h.

◆ wprint

f_print wprint

routine to print graph info with edge weights

Definition at line 53 of file graph.h.


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