Graphviz 13.0.0~dev.20241220.2304
Loading...
Searching...
No Matches
rawgraph.h File Reference
#include <cgraph/list.h>
#include <stdbool.h>
#include <stddef.h>
Include dependency graph for rawgraph.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  vertex
 
struct  rawgraph
 

Functions

rawgraphmake_graph (size_t n)
 makes a graph with n vertices, 0 edges
 
void free_graph (rawgraph *)
 
void insert_edge (rawgraph *, size_t v1, size_t v2)
 inserts edge FROM v1 to v2
 
void remove_redge (rawgraph *, size_t v1, size_t v2)
 removes any edge between v1 to v2 – irrespective of direction
 
bool edge_exists (rawgraph *, size_t v1, size_t v2)
 tests if there is an edge FROM v1 TO v2
 
void top_sort (rawgraph *)
 

Function Documentation

◆ edge_exists()

bool edge_exists ( rawgraph g,
size_t  v1,
size_t  v2 
)

Definition at line 55 of file rawgraph.c.

References vertex::adj_list, rawgraph::vertices, and zeq().

Referenced by addPEdges(), insert_edge(), and set_parallel_edges().

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

◆ free_graph()

void free_graph ( rawgraph g)
extern

Definition at line 32 of file rawgraph.c.

References vertex::adj_list, free(), rawgraph::nvs, and rawgraph::vertices.

Here is the call graph for this function:

◆ insert_edge()

void insert_edge ( rawgraph g,
size_t  v1,
size_t  v2 
)

Definition at line 40 of file rawgraph.c.

References vertex::adj_list, edge_exists(), and rawgraph::vertices.

Referenced by add_edges_in_G(), and set_parallel_edges().

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

◆ make_graph()

rawgraph * make_graph ( size_t  n)

Definition at line 21 of file rawgraph.c.

References vertex::color, gv_alloc(), gv_calloc(), rawgraph::nvs, UNSCANNED, and rawgraph::vertices.

Referenced by create_graphs().

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

◆ remove_redge()

void remove_redge ( rawgraph g,
size_t  v1,
size_t  v2 
)

Definition at line 46 of file rawgraph.c.

References vertex::adj_list, and rawgraph::vertices.

Referenced by removeEdge().

Here is the caller graph for this function:

◆ top_sort()

void top_sort ( rawgraph g)
extern

Definition at line 80 of file rawgraph.c.

References vertex::color, DFS_visit(), rawgraph::nvs, vertex::topsort_order, UNSCANNED, and rawgraph::vertices.

Referenced by assignTrackNo().

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