graph/graph.h at master · githublet/graph · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#ifndef GRAPH_H
#define GRAPH_H

#include "list.h"
#include "hash.h"

typedef void (*data_dtor_func_t)(void *);

typedef struct _graph_vertex_t
{
	void *data;
    int key;
    int is_visit;
    int is_exclude;
	list_t *inedges;
	list_t *edges;
	struct _graph_t *container;
}graph_vertex_t;

typedef int graph_edge_weight_t;

typedef struct _graph_edge_t
{
	struct _graph_vertex_t *src;
	struct _graph_vertex_t *dest;
	int count;
	graph_edge_weight_t weight;
}graph_edge_t;

typedef struct _graph_t
{
	ht_t *vertices;
	data_dtor_func_t vertex_data_dtor;
	size_t size;
}graph_t;

graph_vertex_t *
graph_vertex_create(void *data, int key);

void
graph_vertex_destroy(graph_vertex_t *v);

graph_edge_t *
graph_edge_create(graph_vertex_t *src, graph_vertex_t *dest, graph_edge_weight_t weight);

void
graph_edge_destroy(graph_edge_t *e);

graph_t *
graph_create(data_dtor_func_t dtor);

void
graph_destroy(graph_t *g);

int
graph_add_vertex(graph_t *g, graph_vertex_t *v);

int
graph_has_vertex(graph_t *g, int key);

graph_vertex_t *
graph_get_vertex(graph_t *g, int key);

const list_t *
graph_get_all_vertices(graph_t *g);

int
graph_remove_vertex(graph_t *g,int key);

int
graph_remove_all_vertices(graph_t *g);

int
graph_add_edge(graph_t *g, graph_edge_t *e);

int
graph_has_edge(graph_t *g, int src, int dest);

graph_edge_t *
graph_get_edge(graph_t *g, int src, int dest);

list_t *
graph_vertex_get_all_inedges(graph_t *g, int key);

list_t *
graph_vertex_get_all_outedges(graph_t *g, int key);

const list_t *
graph_vertex_edges_of(graph_t *g, int key);

const list_t *
graph_get_all_edges(graph_t *g);

int
graph_remove_edge(graph_t *g, int src, int dest);

int
graph_remove_all_edges(graph_t *g);

int hasCycle(graph_t *g);

#endif