Graph Representation Multi List Implementation (Mini Project)

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

14358 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C++ Home » Data Structures Home » Graph Representation Multi List Implementation (Mini Project)

A D V E R T I S E M E N T

Title	Graph Representation Multi List Implementation (Mini Project)
Author	fawad naeem qureshi
Author Email	fawad_naeem23 [at] yahoo.com
Description	This is quite simple and useful implementation
Category	C++ » Data Structures
Hits	393801
Code	Select and Copy the Code
Code : ///////////////////////////////////////////////// // IMPLEMENTATION OF GRAPH USING MULTI-LIST // ///////////////////////////////////////////////// // SUBMITTED TO SIR YAHYA KHURRAM // // PREAPRED BY FAWAD NAEEM // // ROLL NO. BCSF03A120 // ///////////////////////////////////////////////// #include<constream.h> template<class T> class Node { friend class Graph<T>; private: T data; Node<T>* vlist; Node<T>* next; int status; public: Node(T val) { data=val; vlist=NULL; next=NULL; } }; template<class T> class Graph { private: Node<T>* head; public: Graph() { head=NULL; } void Insert_Vertex(T val); void Insert_Edge(T v_val,T e_val); void Print_Vertices(); void Print_Edges(T v_val); void Delete_Edge(T v_val,T e_val); void Delete_Vertex(T val); void bfs(); }; ///////////////// // INSERTION // ///////////////// template<class T> void Graph<T>::Insert_Vertex(T val) { Node<T>* temp=new Node<T>(val); if(head==NULL) { head=temp; return; } Node<T>* t=head; while(t->vlist!=NULL) t=t->vlist; t->vlist=temp; } template<class T> void Graph<T>::Insert_Edge(T v_val,T e_val) { if(head==NULL) return; Node<T>* k=head; Node<T>* t=head; Node<T>* temp=new Node<T>(e_val); while(t!=NULL) { if(t->data==v_val) { Node<T>* s=t; while(s->next!=NULL) s=s->next; s->next=temp; while(k!=NULL) { if(k->data==e_val) break; k=k->vlist; } temp->vlist=k; return; } t=t->vlist; } } /////////////////////// // PRINT FUNCTIONS // /////////////////////// template<class T> void Graph<T>::Print_Vertices() { Node<T>* t=head; while(t!=NULL) { cout<<t->data<<" "; t=t->vlist; } } template<class T> void Graph<T>::Print_Edges(T v_val) { Node<T>* t=head; while(t!=NULL) { if(t->data==v_val) { while(t->next!=NULL) { cout<<t->next->vlist->data<<" "; t=t->next; } } t=t->vlist; } } ////////////////// // DELETION // ////////////////// template<class T> void Graph<T>::Delete_Edge(T v_val,T e_val) { if(head==NULL) return; Node<T>* t=head; while(t!=NULL) { if(t->data==v_val) { Node<T>* s=t; t=t->next; while(t!=NULL) { if(t->data==e_val) { s->next=t->next; t=NULL; t->vlist=NULL; delete t; return; } s=t; t=t->next; } } t=t->vlist; } } template<class T> void Graph<T>::Delete_Vertex(T v_val) { if(head==NULL) return; Node<T>* e=head; // Delete Edges in other Vertices while(e!=NULL) { Delete_Edge(e->data,v_val); e=e->vlist; } // Delete Vertex Edges Node<T>* t=head; while(t!=NULL) { if(t->data==v_val) { Node<T>* s=t; while(s->next!=NULL) { Node<T>* k=s->next; while(k!=NULL) k=k->next; k=NULL; k->vlist=NULL; delete k; s=s->next; } } t=t->vlist; } //Delete Vertex if(head->data==v_val) { Node<T>* temp=head; head=head->vlist; temp=NULL; delete temp; return; } Node<T>* p1=head->vlist; Node<T>* p2=head; while(p1!=NULL) { if(p1->data==v_val) { p2->vlist=p1->vlist; p1=NULL; delete p1; return; } p2=p1; p1=p1->vlist; } } //----------------MIAN FUNCTION---------------// void main() { clrscr(); Graph<char> G; G.Insert_Vertex('A'); G.Insert_Vertex('B'); G.Insert_Vertex('C'); G.Insert_Vertex('D'); G.Insert_Edge('A','B'); G.Insert_Edge('A','C'); G.Insert_Edge('A','D'); G.Insert_Edge('B','A'); G.Insert_Edge('B','C'); G.Insert_Edge('B','D'); cout<<" The vertices in the Graph are: "; G.Print_Vertices(); cout<<" Egdes of the given vertex to other vertices are: "; G.Print_Edges('B'); G.Delete_Edge('B','C'); cout<<" Egdes after deletion: "; G.Print_Edges('B'); G.Delete_Vertex('A'); cout<<" The vertices in the Graph After Deletion: "; G.Print_Vertices(); cout<<" Egdes of the given vertex to other vertices are: "; G.Print_Edges('B'); getch(); }

Related Source Codes

Script Name Author

Moving ball screen saver karlmarx

The Classic Game of Snake & Ladder Lakshmi Narayana .A

Railway seat reservation question which comes in sapient VyomWorld

To calculate percentile Ravi Mathur

Send to folder ANIMESH SAHU

Analog clock and calendar Nazia & Rida

HIGH/LOW GAME MOLLY ARORA

Data structure (stack Implimentation) Swapnil B Adsure

Memory Game AnirudhSanyal

Easy Calc Anirudh Sanyal

GK Quiz Anirudh Sanyal

Hangman Game Manish Jain

Snakeman Manish Jain

Full month Calendar Nigi

Cursor shapes nigi

A D V E R T I S E M E N T

Google Groups Subscribe to SourceCodesWorld - Techies Talk

Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.