My Project
Loading...
Searching...
No Matches
Graph< t, size > Class Template Reference

#include <Graph.h>

Collaboration diagram for Graph< t, size >:
Collaboration graph

Public Member Functions

 Graph ()
 Graph (bool x)
void bfs (int levels[size])
void PrintLevels ()
void insertVertex (t vertex)
void makeEdge (int a, int b, float len, float speed, float cap)
void makeEdge (int a, int b, float len, float speed, float cap, float alpha=0.5, float beta=4.0)
int getIndex (t label)
int getVertex ()
bool isEmpty ()
int No_of_edges_btw_2_vertices (t data, t data2)
void DeleteEdge (t data1, t data2)
void DeleteVertex (t data)
void dfs ()
Gnode< t > * getNodes ()
bool edgeExist (t data1, t data2)
int No_Of_Edges ()
Graph minimumSpanningtree ()
void Shortest_Link_btw_two_vertices (t data, t data1)
list< t > shortest_Path_btw2_vericex_returing_list (t data, t data2)
void shortest_Path_btw2_vericex (t data, t data2)
bool searchVertex (t data)
int getDegree (t data)
void Type ()
string display_edge_of_index (string s)
void Incoming (t target)
RoadDetails & getEdgeDetails (t data, t data1)
list< RoadDetails * > getEdges (t data, list< RoadDetails * > edges)
float AverageRush ()
t getVertexAt (int i)
string printGrapgh ()
double total_System_Cost ()
string printRoadSnapshot ()

Public Attributes

int Vcount

Detailed Description

template<class t, int size>
class Graph< t, size >

Definition at line 24 of file Graph.h.

Constructor & Destructor Documentation

◆ Graph() [1/2]

template<class t, int size>
Graph< t, size >::Graph ( )
inline

Definition at line 31 of file Graph.h.

Here is the caller graph for this function:

◆ Graph() [2/2]

template<class t, int size>
Graph< t, size >::Graph ( bool x)
inline

Definition at line 35 of file Graph.h.

Member Function Documentation

◆ AverageRush()

template<class t, int size>
float Graph< t, size >::AverageRush ( )
inline

Definition at line 609 of file Graph.h.

◆ bfs()

template<class t, int size>
void Graph< t, size >::bfs ( int levels[size])
inline

Definition at line 40 of file Graph.h.

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

◆ DeleteEdge()

template<class t, int size>
void Graph< t, size >::DeleteEdge ( t data1,
t data2 )
inline

Definition at line 183 of file Graph.h.

Here is the call graph for this function:

◆ DeleteVertex()

template<class t, int size>
void Graph< t, size >::DeleteVertex ( t data)
inline

Definition at line 204 of file Graph.h.

Here is the call graph for this function:

◆ dfs()

template<class t, int size>
void Graph< t, size >::dfs ( )
inline

Definition at line 232 of file Graph.h.

Here is the call graph for this function:

◆ display_edge_of_index()

template<class t, int size>
string Graph< t, size >::display_edge_of_index ( string s)
inline

Definition at line 533 of file Graph.h.

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

◆ edgeExist()

template<class t, int size>
bool Graph< t, size >::edgeExist ( t data1,
t data2 )
inline

Definition at line 256 of file Graph.h.

Here is the call graph for this function:

◆ getDegree()

template<class t, int size>
int Graph< t, size >::getDegree ( t data)
inline

Definition at line 511 of file Graph.h.

Here is the call graph for this function:

◆ getEdgeDetails()

template<class t, int size>
RoadDetails & Graph< t, size >::getEdgeDetails ( t data,
t data1 )
inline

Definition at line 574 of file Graph.h.

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

◆ getEdges()

template<class t, int size>
list< RoadDetails * > Graph< t, size >::getEdges ( t data,
list< RoadDetails * > edges )
inline

Definition at line 591 of file Graph.h.

Here is the call graph for this function:

◆ getIndex()

template<class t, int size>
int Graph< t, size >::getIndex ( t label)
inline

Definition at line 142 of file Graph.h.

Here is the caller graph for this function:

◆ getNodes()

template<class t, int size>
Gnode< t > * Graph< t, size >::getNodes ( )
inline

Definition at line 255 of file Graph.h.

Here is the caller graph for this function:

◆ getVertex()

template<class t, int size>
int Graph< t, size >::getVertex ( )
inline

Definition at line 150 of file Graph.h.

◆ getVertexAt()

template<class t, int size>
t Graph< t, size >::getVertexAt ( int i)
inline

Definition at line 628 of file Graph.h.

Here is the caller graph for this function:

◆ Incoming()

template<class t, int size>
void Graph< t, size >::Incoming ( t target)
inline

Definition at line 554 of file Graph.h.

Here is the call graph for this function:

◆ insertVertex()

template<class t, int size>
void Graph< t, size >::insertVertex ( t vertex)
inline

Definition at line 96 of file Graph.h.

Here is the caller graph for this function:

◆ isEmpty()

template<class t, int size>
bool Graph< t, size >::isEmpty ( )
inline

Definition at line 152 of file Graph.h.

◆ makeEdge() [1/2]

template<class t, int size>
void Graph< t, size >::makeEdge ( int a,
int b,
float len,
float speed,
float cap )
inline

Definition at line 106 of file Graph.h.

Here is the caller graph for this function:

◆ makeEdge() [2/2]

template<class t, int size>
void Graph< t, size >::makeEdge ( int a,
int b,
float len,
float speed,
float cap,
float alpha = 0.5,
float beta = 4.0 )
inline

Definition at line 123 of file Graph.h.

◆ minimumSpanningtree()

template<class t, int size>
Graph Graph< t, size >::minimumSpanningtree ( )
inline

Definition at line 290 of file Graph.h.

Here is the call graph for this function:

◆ No_Of_Edges()

template<class t, int size>
int Graph< t, size >::No_Of_Edges ( )
inline

Definition at line 273 of file Graph.h.

◆ No_of_edges_btw_2_vertices()

template<class t, int size>
int Graph< t, size >::No_of_edges_btw_2_vertices ( t data,
t data2 )
inline

Definition at line 154 of file Graph.h.

Here is the call graph for this function:

◆ printGrapgh()

template<class t, int size>
string Graph< t, size >::printGrapgh ( )
inline

Definition at line 630 of file Graph.h.

Here is the call graph for this function:

◆ PrintLevels()

template<class t, int size>
void Graph< t, size >::PrintLevels ( )
inline

Definition at line 72 of file Graph.h.

Here is the call graph for this function:

◆ printRoadSnapshot()

template<class t, int size>
string Graph< t, size >::printRoadSnapshot ( )
inline

Definition at line 653 of file Graph.h.

◆ searchVertex()

template<class t, int size>
bool Graph< t, size >::searchVertex ( t data)
inline

Definition at line 509 of file Graph.h.

Here is the call graph for this function:

◆ Shortest_Link_btw_two_vertices()

template<class t, int size>
void Graph< t, size >::Shortest_Link_btw_two_vertices ( t data,
t data1 )
inline

Definition at line 346 of file Graph.h.

Here is the call graph for this function:

◆ shortest_Path_btw2_vericex()

template<class t, int size>
void Graph< t, size >::shortest_Path_btw2_vericex ( t data,
t data2 )
inline

Definition at line 445 of file Graph.h.

Here is the call graph for this function:

◆ shortest_Path_btw2_vericex_returing_list()

template<class t, int size>
list< t > Graph< t, size >::shortest_Path_btw2_vericex_returing_list ( t data,
t data2 )
inline

Definition at line 381 of file Graph.h.

Here is the call graph for this function:

◆ total_System_Cost()

template<class t, int size>
double Graph< t, size >::total_System_Cost ( )
inline

Definition at line 638 of file Graph.h.

◆ Type()

template<class t, int size>
void Graph< t, size >::Type ( )
inline

Definition at line 524 of file Graph.h.

Member Data Documentation

◆ Vcount

template<class t, int size>
int Graph< t, size >::Vcount

Definition at line 30 of file Graph.h.

The documentation for this class was generated from the following file: