Graph< t, size > Class Template Reference

#include <Header1.h>

Collaboration diagram for Graph< t, size >:

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 ()
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

Constructor & Destructor Documentation

Graph() [1/2]

template<class t, int size>

Graph< t, size >::Graph ( )

inline

Here is the caller graph for this function:

Graph() [2/2]

template<class t, int size>

Graph< t, size >::Graph ( bool x )

inline

Member Function Documentation

AverageRush()

template<class t, int size>

float Graph< t, size >::AverageRush ( )

inline

bfs()

template<class t, int size>

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

inline

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

Here is the call graph for this function:

DeleteVertex()

template<class t, int size>

void Graph< t, size >::DeleteVertex ( t data )

inline

Here is the call graph for this function:

dfs()

template<class t, int size>

void Graph< t, size >::dfs ( )

inline

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

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

Here is the call graph for this function:

getDegree()

template<class t, int size>

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

inline

Here is the call graph for this function:

getEdgeDetails()

template<class t, int size>

RoadDetails & Graph< t, size >::getEdgeDetails ( t data, t data1 )

inline

Here is the call graph for this function:

getEdges()

template<class t, int size>

list< RoadDetails * > Graph< t, size >::getEdges ( t data, list< RoadDetails * > edges )

inline

Here is the call graph for this function:

getIndex()

template<class t, int size>

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

inline

Here is the caller graph for this function:

getVertex()

template<class t, int size>

int Graph< t, size >::getVertex ( )

inline

getVertexAt()

template<class t, int size>

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

inline

Incoming()

template<class t, int size>

void Graph< t, size >::Incoming ( t target )

inline

Here is the call graph for this function:

insertVertex()

template<class t, int size>

void Graph< t, size >::insertVertex ( t vertex )

inline

Here is the caller graph for this function:

isEmpty()

template<class t, int size>

bool Graph< t, size >::isEmpty ( )

inline

makeEdge() [1/2]

template<class t, int size>

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

inline

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

minimumSpanningtree()

template<class t, int size>

Graph Graph< t, size >::minimumSpanningtree ( )

inline

Here is the call graph for this function:

No_Of_Edges()

template<class t, int size>

int Graph< t, size >::No_Of_Edges ( )

inline

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

Here is the call graph for this function:

printGrapgh()

template<class t, int size>

string Graph< t, size >::printGrapgh ( )

inline

Here is the call graph for this function:

PrintLevels()

template<class t, int size>

void Graph< t, size >::PrintLevels ( )

inline

Here is the call graph for this function:

printRoadSnapshot()

template<class t, int size>

string Graph< t, size >::printRoadSnapshot ( )

inline

searchVertex()

template<class t, int size>

bool Graph< t, size >::searchVertex ( t data )

inline

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

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

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

Here is the call graph for this function:

total_System_Cost()

template<class t, int size>

double Graph< t, size >::total_System_Cost ( )

inline

Type()

template<class t, int size>

void Graph< t, size >::Type ( )

inline

Member Data Documentation

Vcount

template<class t, int size>

int Graph< t, size >::Vcount

---

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

• Header1.h