#include <iostream>
#include<iomanip>
using namespace std;
const int MAX=30;
class node
{
node *next;
string city;
int timeCost;
public:
friend class graph;
node()
{
next=NULL;
city="";
timeCost=-1;
}
node(string city,int weight)
{
next=NULL;
this->city=city;
timeCost=weight;
}
};
class graph
{
node *head[MAX];
int n;
public:
graph(int num)
{
n=num;
for(int i=0;i<n;i++)
head[i]=NULL;
}
void insert(string city1,string city2,int time);
void insertUndirected(string city1,string city2,int time);
void readdata(int gType);
int getindex(string s1);
void outFlights();
void inFlights();
};
void graph::inFlights()
{
int count[n];
for(int i=0;i<n;i++)
count[i]=0;
cout<<"====== In degree =========\n";
for(int i=0;i<n;i++)
{
cout<<"\n"<<setw(8)<<"Source"<<setw(8)<<"Destin."<<setw(8)<<"Time";
for(int j=0;j<n;j++)
{
node *p=head[j]->next;
while(p!=NULL)
{
if(p->city==head[i]->city)
{
count[i]=count[i]+1;
cout<<"\n"<<setw(8)<<head[j]->city<<setw(8)<<head[i]->city<<setw(8)<<p->timeCost;
}
p=p->next;
}
}
cout<<"\nFlights to "<<head[i]->city<<" = "<<count[i]<<endl;
cout<<"-------------------------------------\n";
}
}
void graph::outFlights()
{
int count;
for(int i=0;i<n;i++)
{
node *p=head[i]->next;
count=0;
cout<<"\n"<<setw(8)<<"Source"<<setw(8)<<"Destin."<<setw(8)<<"Time";
if(p==NULL)
{
cout<<"\nNo Flights from "<<head[i]->city;
}
else
{
while(p!=NULL)
{
cout<<"\n"<<setw(8)<<head[i]->city<<setw(8)<<p->city<<setw(8)<<p->timeCost;
count++;
p=p->next;
}
}
cout<<"\nNo. of flights: "<<count<<endl;;
cout<<"-------------------------------------\n";
}
}
int graph::getindex(string s1)
{
for(int i=0;i<n;i++)
{
if(head[i]->city==s1)
return i;
}
return -1;
}
void graph::insert(string city1,string city2,int time)
{
node *source;
node *dest=new node(city2,time);
int ind=getindex(city1); //for getting head nodes index in array
if(head[ind]==NULL)
head[ind]=dest;
else
{
source=head[ind];
while(source->next!=NULL)
source=source->next;
source->next=dest;
}
}
void graph::insertUndirected(string city1,string city2,int time)
{
node *source;
node *dest=new node(city2,time);
node *dest2=new node(city1,time); //for second flight insertion
int ind=getindex(city1); //for getting head nodes index in array
int ind2=getindex(city2);
if(head[ind]==NULL && head[ind2]==NULL) //when no flights in graph
{
head[ind]=dest;
head[ind2]=dest2;
}
else if(head[ind]==NULL && head[ind2]!=NULL) //no flight in first list but flight in
second list
{
head[ind]=dest; //inserted first flight
source=head[ind2];
while(source->next!=NULL)
source=source->next;
source->next=dest2;
}
else if(head[ind]!=NULL && head[ind2]==NULL)
{
head[ind2]=dest2; //inserted first flight
source=head[ind];
while(source->next!=NULL)
source=source->next;
source->next=dest;
}
else
{
source=head[ind];
while(source->next!=NULL)
source=source->next;
source->next=dest;
source=head[ind2];
while(source->next!=NULL)
source=source->next;
source->next=dest2;
}
}
void graph::readdata(int gType)
{
string city1,city2,tmpcity;
int fcost;
int flight;
cout<<"\nENter City Details:\n ";
for(int i=0;i<n;i++)
{
head[i]=new node;
cout<<"Enter City "<<i+1<<" ";
cin>>tmpcity;
head[i]->city=tmpcity;
}
cout<<"\nEnter Number of Flights to insert: ";
cin>>flight;
if(gType==1)
{
for(int i=0;i<flight;i++)
{
cout<<"\nEnter Source:";
cin>>city1;
cout<<"Enter Destination:";
cin>>city2;
cout<<"Enter Time:";
cin>>fcost;
insert(city1,city2,fcost);
}
}
else
{
for(int i=0;i<flight;i++)
{
cout<<"\nEnter Source:";
cin>>city1;
cout<<"Enter Destination:";
cin>>city2;
cout<<"Enter Time:";
cin>>fcost;
insertUndirected(city1,city2,fcost);
//cout<<"\ninserted"<<i+1;
}
}
}
int main() {
int number,choice;
int graphype;
cout<<"0. Undirected\[Link]\nEnter Flight data Insertion Type:";
cin>>graphype;
cout<<"\nENter Number of Airport Stations:";
cin>>number;
graph g1(number);
[Link](graphype);
do
{
cout<<"------Menu------"
<<"\[Link] Flights(In degree)"
<<"\[Link] Flights(Out degree)"
<<"\[Link]"
<<"\nEnter your choice: ";
cin>>choice;
switch(choice)
{
case 1:
cout <<"" << endl;
[Link]();
break;
case 2:
[Link]();
break;
default:
cout<<"\nWrong Choice";
}
}while(choice!=3);
// prints
return 0;
}
