Time-Saver/graph.h at master · Aditya-debug15/Time-Saver · 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
#ifndef __GRAPH_H
#define __GRAPH_H
#include "priority_queue.h"
#define INF 123456

typedef struct AdjList AdjList;
typedef struct AdjList* PtrAdjList;
typedef struct Node Node;
typedef struct Node* PtrNode;

struct AdjList{
    int degree;   // total number of vertex
    PtrNode vertex; // array of pointer to nodes
};

struct Node
{
    int vertexid; // number of the vertex
    double length;   // length of the road in km
    int cars;     // cars present on the road
    double time;   // time required to cross that road in minutes
    Node* Next;
};

// functions on the Adj List

PtrAdjList    CreateEmptyGraph(int degree);
void          InsertEdge(PtrAdjList G,int vertex1,int vertex2,double length,int cars);
double        CalTime(double length, int cars);
void          UpdateDis(PtrAdjList G,int vertex1,int vertex2,double new_length);
void          UpdateCars(PtrAdjList G,int vertex1,int vertex2,int new_cars);
void          DeleteEdge(PtrAdjList G,int vertex1,int vertex2);
void          PrintList(PtrAdjList G);
void          Dijkstra_shortest_length(PtrAdjList G,double* distance_source,int* prev,int source);
void          print_shortest_path(int* prev,int source,int destination,Ptr_S Stack);
void          Dijkstra_shortest_time(PtrAdjList G, double *time_source, int *prev, int source);
void          print_shortes_time_path(int* prev,int source,int destination,Ptr_S Stack);
void          shortest_distance_choice4(PtrAdjList graph,int source,int destination);
void          shortest_time_choice5(PtrAdjList graph,int source, int destination);
void          DeleteList(PtrAdjList G);
#endif