network/directed_graph.h at master · michaelaah/network · 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
/*
 * This is a direcected graph header file - providing the forward declarations
 * for the directed_graph.c file.
 */

#ifndef __DIRECTED_GRAPH_HEADER
#define __DIRECTED_GRAPH_HEADER

#include <iostream>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <float.h>
#include "linked_list.h"
#include "vertex.h"
#include "priority_queue.h"

#define MAX FLT_MAX

typedef struct _DirectedGraph
{
	LinkedList* vertexList;
	int valueSize;
	float** adjacencyMatrix;

} DirectedGraph;

DirectedGraph*  initialize_digraph(int, char*);
int		digraph_size(DirectedGraph*);
Vertex*		get_vertex(DirectedGraph*, void*);
bool		add_vertex(DirectedGraph*, void*);
bool		remove_vertex(DirectedGraph*, void*);
LinkedList*	get_vertices(DirectedGraph*);
LinkedList*	get_arcs(DirectedGraph*, void*);
bool		add_arc(DirectedGraph*, void*, void*, float);
bool		remove_arc(DirectedGraph*, void*, void*);
bool		change_arc_weight(DirectedGraph*, void*, void*, float);
int 		connected_vertices_count(DirectedGraph*, void*);
int		_connected_vertices_count_recursive(DirectedGraph*, void*);
void*		source_vertex(DirectedGraph*);
void		set_visited_field(DirectedGraph*, bool);
void		buildTree(DirectedGraph*, void*);
float		get_arc_weight(DirectedGraph*, void*, void*);
void		reset_parent_links(DirectedGraph*);
int		compareVertex(void*, void*);
LinkedList*	dijkstra(DirectedGraph*, void*, void*);
float**		all_pairs_shortest_paths(DirectedGraph*);
void		create_adjacency_matrix(DirectedGraph*);
float**		get_adjacency_matrix(DirectedGraph*);
bool 		contains_vertex(DirectedGraph*, void*);
DirectedGraph*  create_digraph_from_file(char*);
float		extract_value(int, int, char*);
float*		float_arr_from_str(char*);
int		value_count(char*);
std::ostream& 	operator<<(std::ostream& o, DirectedGraph& net);

#endif