sem3/algo/workshop2/dfs/graph.h


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

#ifndef GRAPH_H_
#define GRAPH_H_

#define COLOR_WHITE 0
#define COLOR_GRAY 1
#define COLOR_BLACK 2

#define HASHSIZE 128

struct vertex_struct;

// Linked list
typedef struct edge_struct {
    int weight;
    struct vertex_struct *from;
    struct vertex_struct *to;
    // Linked list stuff
    struct edge_struct *next;
    struct edge_struct *prev;
} edge_t;

typedef struct vertex_struct {
    char *ref;
    int color;

    int dtime;
    int ftime;

    edge_t *adj;

    // Hash table stuff
    struct vertex_struct *next;
} vertex_t;

typedef struct {
    vertex_t *hashtable[128];
} graph_t;

int graph_to_dot(FILE *f, graph_t *g);
int graph_print_adj(graph_t *g, char *ref);
void graph_edge(graph_t *g, char *from, char *to, int weight);
edge_t *edge_next(graph_t *g, edge_t *e);
vertex_t *vertex_next(graph_t *g, vertex_t *v);

#endif // GRAPH_H_