#include
#include
#include
int cost[10][10],i,j,k,n,queue[10],front,rear,v,visit[10],visited[10];
void main()
{
	int m;
	clrscr();
	cout <<"enterno of vertices";
	cin >> n;
	cout <<"ente no of edges";
	cin >> m;
	cout <<"\nEDGES \n";
	for(k=1;k<=m;k++)
	{
		cin >>i>>j;
		cost[i][j]=1;
	}
	cout <<"enter initial vertex";
	cin >>v;
	cout <<"Visitied vertices\n";
	cout << v;
	visited[v]=1;
	k=1;
	while(k
b)Program to implement Depth First Search Algorithm.
#include
#include
#include
int cost[10][10],i,j,k,n,stack[10],top,v,visit[10],visited[10];
void main()
{
	int m;
	cout <<"enterno of vertices";
	cin >> n;
	cout <<"ente no of edges";
	cin >> m;
	cout <<"\nEDGES \n";
	for(k=1;k<=m;k++)
	{
		cin >>i>>j;
		cost[i][j]=1;
	}
	cout <<"enter initial vertex";
	cin >>v;
	cout <<"ORDER OF VISITED VERTICES";
	cout << v <<" ";
	visited[v]=1;
	k=1;
	while(k=1;j--)
			if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)
			{
				visit[j]=1;
				stack [top]=j;
				top++;
			}
		v= stack [--top];
		cout<
The post C++ programs to implement Graph Traversal Techniques – Depth First Search/Breadth First Search first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/c-programs-to-implement-graph-traversal-techniques-depth-first-searchbreadth-first-search/feed/
			6
		
		
			
		
		
		https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-queue-using-linked-representation/
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-queue-using-linked-representation/#comments
		
		
		Mon, 31 Jan 2011 12:14:56 +0000
				
		
		
		
		
		
		http://studentprojects.in/?p=1267

					#include template class Node { friend LinkedQueue; private: T data; Node *link; }; template class LinkedQueue { public: LinkedQueue() {front = rear = 0;} // constructor ~LinkedQueue(); // destructor int IsEmpty() const {return ((front) ? 0 : 1);} T First() const; // return first element T Last() const; // return last element LinkedQueue& Add(const T&

The post C++ program to implement Queue using Linked Representation first appeared on Student Projects.
]]>
										
#include 
template
class Node
{
	friend LinkedQueue;
	private:
	T data;
	Node *link;
};
template
class LinkedQueue {
	public:
		LinkedQueue() {front = rear = 0;} // constructor
		~LinkedQueue(); // destructor
		int IsEmpty() const
		{return ((front) ? 0 : 1);}
		T First() const; // return first element
		T Last() const; // return last element
		LinkedQueue& Add(const T& x);
		LinkedQueue& Delete(T& x);
	private:
		Node *front;  // pointer to first node
		Node *rear;   // pointer to last node
};

	template
LinkedQueue::~LinkedQueue()
{// Queue destructor.  Delete all nodes.
	Node *next;
	while (front) {
		next = front->link;
		delete front;
		front = next;
	}
}
template
T LinkedQueue::First() const
{
	if (IsEmpty())   { cout<<"OutOfBounds()";  return -1; };
	return front->data;
}
template
T LinkedQueue::Last() const
{
	if (IsEmpty()) { cout<<"OutOfBounds()";    return -1; };
	return rear->data;
}
	template
LinkedQueue& LinkedQueue::Add(const T& x)
{
	Node *p = new Node;
	p->data = x;
	p->link = 0;
	if (front) rear->link = p;  // queue not empty
	else front = p;             // queue empty
	rear = p;
	return *this;
}
	template
LinkedQueue& LinkedQueue::Delete(T& x)
{
	if (IsEmpty()) {  cout<<"OutOfBounds()"; return *this; };
	x = front->data;
	Node *p = front;
	front = front->link;
	delete p;
	return *this;
}
void main(void)
{
	LinkedQueue Q;
	int x;
	Q.Add(1).Add(2).Add(3).Add(4);
	cout << "No queue add failed" << endl;
	cout << "Queue is now 1234" << endl;
	Q.Delete(x);
	cout << "Deleted " << x << endl;
	cout << Q.First() << " is at front" << endl;
	cout << Q.Last() << " is at end" << endl;
	Q.Delete(x);
	cout << "Deleted " << x << endl;
	Q.Delete(x);
	cout << "Deleted " << x << endl;
	Q.Delete(x);
	cout << "Deleted " << x << endl;
	cout << "No queue delete failed " << endl;
}
The post C++ program to implement Queue using Linked Representation first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-queue-using-linked-representation/feed/
			3