GraphLEFunctions

#include <iostream>
#include <list>
#include<string>
#include "GraphADT.h"
using namespace std;

Graph::Graph(int x)
{
	V = x;
	adj = new list <int>[V];
	adj2 = new float*[V];
	for (int i = 0; i < V; i++)
	{
		adj2[i] = new float[V];
	}
	for (int i = 0; i < V; i++)
	{
		for (int j = 0; j < V; j++)
		{
			adj2[i][j] = 0;
		}
	}
	places = new vertex[V];
	cout << endl << "Input Vertices Information..." << endl;
	for (int i = 0; i < V; i++)
	{
		places[i].v = i;
		cout << "V[" << places[i].v << "]...\nLabel: ";
		cin >> places[i].label;
	}
}

void Graph::addEdge(int u, int v)
{
	adj[u].push_back(v);
}

void Graph::addEdge2(int u, int v, float total)
{
	adj2[u][v] = total;
}

// A utility function to print the adjacency list
// representation of graph
void Graph::printGraph()
{
	cout << "Adjacency List..." << endl;
	for (int v = 0; v < V; ++v)
	{
		cout << "V[" << v << "]";
		for (auto x : adj[v])
			cout << " -> " << places[x].label;
		cout << endl;
	}
}

void Graph::DFSUtil(int v, bool visited[])
{
	// Mark the current node as visited and
	// print it
	visited[v] = true;
	cout << places[v].label << " ";

	// Recur for all the vertices adjacent
	// to this vertex
	list<int>::iterator i;
	for (i = adj[v].begin(); i != adj[v].end(); ++i)
		if (!visited[*i])
			DFSUtil(*i, visited);
}

// DFS traversal of the vertices reachable from v.
// It uses recursive DFSUtil()
void Graph::DFS(int v)
{
	// Mark all the vertices as not visited
	bool *visited = new bool[V];
	for (int i = 0; i < V; i++)
		visited[i] = false;

	// Call the recursive helper function
	// to print DFS traversal
	DFSUtil(v, visited);

	/*for (int i = 0; i < V; i++)
	{
		if (!visited[i])
		{
			cout << places[i].label << ' ';
		}
	}*/
}

void Graph::BFS(int s)
{
	//Mark all the vertices as not visited
	bool *visited = new bool[V];
	for (int i = 0; i < V; i++)
	{
		visited[i] = false;
	}

	//Create a queue for BFS
	list<int> queue;

	//Mark the current node as visited and enqueue it
	visited[s] = true;
	queue.push_back(s);

	//'i' will be used to get all adjacent
	//vertices of a vertex
	list<int>::iterator i;

	while (!queue.empty())
	{
		//Dequeue a vertex from queue and print it
		s = queue.front();
		cout << places[s].label << " ";
		queue.pop_front();

		//Get all adjacent vertices of the dequeued
		//verte s. If an adjacent has not been visited, then mark it visited and enqueue it
		for (i = adj[s].begin(); i != adj[s].end(); ++i)
		{
			if (!visited[*i])
			{
				visited[*i] = true;
				queue.push_back(*i);
			}
		}
	}
	/*for (int i = 0; i < V; i++)
	{
		if (!visited[i])
		{
			cout << places[i].label << ' ';
		}
	}*/
}