HPAir flight map problem

[mimi88]

I am trying to write a program that will read three txt file, first has city names,second the flight map,and third has the request flight.for this input the program should produce the following output:

Request is to fly from Albuquerque to San Diego.
HPAir flies from Albuquerque to San Diego.

Request is to fly from Albuquerque to Paris.
Sorry.HPAir does not serve Paris.

I made some of the header file and just started doing the main, but I don't know how.please help me understand and build the correct code, I have the pseudo code for some of them but not all and I couldn't translate it to a code.
the following is the header file and main part:

 #pragma once

#include <string>
#include <iostream>
#include <fstream>
#include "Node.h"

using namespace std;

typedef int City;

const int MAX_CITIES = 50;
const City NO_CITY = -1;

class Map
{
private:
	string cities[MAX_CITIES];
	bool visited[MAX_CITIES];
	Node<City>* map[MAX_CITIES];
	int numCities;
	
	void unvisitedAll();
	
	void markVisited(City);
		/*
	markVisited(city,c)
	visited[c]=true
	*/
	

	City getNextCity(City);
	/*
		city getNextCity(city c)
			node<city>* ptr=map[c];
			bool found=false
			city next=NO_CITY
			while (ptr != nullptr and !found)
			{
				if (!isVisited(ptr->getitem()))
					{
					next=ptr->get item()
					found = true
					}
				ptr=pts->getnext();
			}
			return next
	*/
	bool isPath(City, City);
	bool isVisited(City);
	City getIndex(string);
	/*
		city getIndex (string c)
		bool found=false;  city index=0;
		while (!found and index < numCities)
			if (c==cities[index])
			  found=true
			else
			index++
		if (found)
			return index
			return NO-CITY
	*/
	void insertAdjacent(City, City);
	/*
		insertAdjacent( city fromcity, city tocity)
		node<city>*newcity= new node<city>(tocity, map[fromcity])
		map[fromcity]=newcity
	*/
	void splitCities(string, string&, string&);

public:
	Map();

	void readFlightMap(string, string);

	void flights(string);

};
template<class ItemType>
void Map::unvisitedAll()
{
	for (int cities = 0; cities < numCities; cities++)

		visited[cities] = false;
}
template<class ItemType>
void Map::markVisited()
{
	markVisited(city, c);
	visited[c] = true;
}
template<class ItemType>
City Map::getNextCity(City)
{
	/* City getNextCity(city c)
		node<city>* ptr = map[c];
	bool found = false;
	city next = NO_CITY;
	while (ptr != nullptr and !found)
	{
		if (!isVisited(ptr->getitem()))
		{
			next = ptr->get item();
				found = true;
		}
		ptr = pts->getnext();
	}
	return next; */
}



/* this is the main */

#include <iostream>
#include <string>
#include "Map.h"


using namespace std;

int main()
{
	Map HPAir;
        HPAir.readFlightMap("cities.txt", "flightmap.txt");
	HPAir.flights("request.txt");
	
	

	system("pause");
	return 0;
}

[shadowCODE]

How is data in request.txt , cities.txt, flightmap.txt structured?

[c p p]

request.txt:
Albuquerque, San Diego
San Diego, Chicago
etc...

------------------------------------

cities.txt:
Albuquerque
Chicago
San Diego
etc...

------------------------------------

flightmap.txt:
Albuquerque, San Diego
San Diego, Chicago
etc...

I am working on the same problem by the way :)

[shadowCODE]

From mimi88's code and pseudo code, i am beginning to think there is much more to the question.

First, depending on the sample output and input text files, i dont see any use for cities.txt.

You simply check in the flightmap for a corresponding match in request.

Also, i see
bool visited, Node<City> *, getNextCity(), isPath(), etc... . This tells me that you are actually building a route. Is that part of the question?

It would be better if for all of us if you lay out your ideas. @cpp hoping to hear from you.

[mimi88]

I guess we should build a rout to know which city we visited and if there is a rout from-to the city requested.

[mimi88]

any one want to help?