I need help with my code. I don't know what I am doing wrong. Using the attached shell program (AirportCombos.cpp), create a list of strings to process and place on a STL DEQUE container. Using the provided 3 char airport codes, create a 6 character string that is the origin & destination city pair. Create all the possible origin/destinations possible combinations from the airport codes provided. Load the origin/destination string onto a queue ( using the STL deque) for processing. Do not load same/same values, such as DALDAL, or LAXLAX. See comments in the program from more details. Do not confuse the term queue with the 'queue' container. A queue provides data in a First-in First-out (FIFO) order. A 'queue' container adapter is a coding definition that can be built using vectors or lists or deques. After loading the values, display all the values in the container. #include #include #include using namespace std; const int AIRPORT_COUNT = 12; string airports[AIRPORT_COUNT] = {"DAL","ABQ","DEN","MSY","HOU","SAT","CRP","MID","OKC","OMA","MDW","TUL"}; int main() { // define stack (or queue ) here //creating a deque object deque iDeque; string origin; string dest; string citypair; cout << "Loading the CONTAINER ..." << endl; // LOAD THE queue HERE // Create all the possible Airport combinations that could exist from the list provided. // i.e DALABQ, DALDEN, ...., ABQDAL, ABQDEN ... // DO NOT Load SameSame - DALDAL, ABQABQ, etc .. //enque for(int i = 0; i < AIRPORT_COUNT; i++) { origin = airports[i]; for(int j = 0; j < AIRPORT_COUNT; j++) { dest = airports[j]; citypair = ""; // DO NOT Load SameSame - DALDAL, ABQABQ, etc .. if (origin.compare(dest) != 0) citypair = origin + dest; iDeque.push_back(citypair); } } cout << "Getting data from the CONTAINER ..." << endl; //QUEUE here //Displaying the dequeue numbers while(!iDeque.isEmpty()) { cout <
I need help with my code. I don't know what I am doing wrong.
Using the attached shell program (AirportCombos.cpp), create a list of strings to process and place on a STL DEQUE container.
Using the provided 3 char airport codes, create a 6 character string that is the origin & destination city pair. Create all the possible origin/destinations possible combinations from the airport codes provided. Load the origin/destination string onto a queue ( using the STL deque) for processing. Do not load same/same values, such as DALDAL, or LAXLAX. See comments in the program from more details.
Do not confuse the term queue with the 'queue' container. A queue provides data in a First-in First-out (FIFO) order. A 'queue' container adapter is a coding definition that can be built using
After loading the values, display all the values in the container.
#include <iostream>
#include <string>
#include <deque>
using namespace std;
const int AIRPORT_COUNT = 12;
string airports[AIRPORT_COUNT] = {"DAL","ABQ","DEN","MSY","HOU","SAT","CRP","MID","OKC","OMA","MDW","TUL"};
int main()
{
// define stack (or queue ) here
//creating a deque object
deque<int> iDeque;
string origin;
string dest;
string citypair;
cout << "Loading the CONTAINER ..." << endl;
// LOAD THE queue HERE
// Create all the possible Airport combinations that could exist from the list provided.
// i.e DALABQ, DALDEN, ...., ABQDAL, ABQDEN ...
// DO NOT Load SameSame - DALDAL, ABQABQ, etc ..
//enque
for(int i = 0; i < AIRPORT_COUNT; i++)
{
origin = airports[i];
for(int j = 0; j < AIRPORT_COUNT; j++)
{
dest = airports[j];
citypair = "";
// DO NOT Load SameSame - DALDAL, ABQABQ, etc ..
if (origin.compare(dest) != 0)
citypair = origin + dest;
iDeque.push_back(citypair);
}
}
cout << "Getting data from the CONTAINER ..." << endl;
//QUEUE here
//Displaying the dequeue numbers
while(!iDeque.isEmpty())
{
cout <<iDeque.front() << endl;
iDeque.pop_front();
}
// for(int i = 0; i <AIRPORT_COUNT; i++){
// cout << iDeque.front();
// iDeque.pop();
// }
// }
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
