protected:

map<char, vector<kNode*>> edges;

public:

kGraph();

~kGraph();

void insertEdge(char P, char C, int weight);

void iterateEdges();

vector<char> primAlgo(char spawn);

kNode * temp = new kNode();

temp->weight = weight;

temp->vertex = C;

edges[P].push_back(temp);

temp = new kNode();

temp->weight = weight;

temp->vertex = P;

edges[C].push_back(temp);

for (map<char, vector<kNode*>>::iterator it = edges.begin(); it != edges.end(); it++) {

cout << it->first << " connects with these nodes:\n";

for (kNode* n : it->second) {

cout << "Node - " << n->vertex << " Edge weight: " << n->weight << endl;

}

}

//map<char, vector<kNode*>>::iterator it;

vector<char> disc;

disc.push_back(spawn);

int numKeys = edges.size();

int lWeight;// 'local weight'.

char nNode;

int iterations;

int totalW = 0;

// robustness measure, the spawn and subsequent traversal may lead to a dead end, at which point, start from the original spawn and just go the other way.

char start = spawn;

while (numKeys > disc.size()){

lWeight = INT_MAX;

if ( iterations == numKeys ) {

spawn = start; //robustness measure

iterations = 0;//incase it happens again lol.

}

for (kNode* e : edges[spawn]) {

if (e->weight < lWeight &&

find(disc.begin(),disc.end(),e->vertex) == disc.end()) {

nNode = e->vertex;

lWeight = e->weight;

}

}

// robustness measure

if (lWeight!=INT_MAX ) {

disc.push_back(nNode);

cout << spawn << " routes to " << nNode << " with weight " << lWeight << endl;

spawn = nNode;

totalW += lWeight;

}

iterations++;

}

cout << "traversal cost: " << totalW << endl;

return disc;

int temp;

if (right-left <=1) {

return;

}

//select pivot value. [heuristically today, middle of posts.

//move it to the front of this partition.

int pivot = arr[((right-left)/2) + left];

arr[((right-left))/2 + left] = arr[left];

arr[left] = pivot;

int pInd = left;

//iterate through partition and sort according to pivot value.

for (int i = left+1;i<=right; i++) {

if (arr[i] < pivot) {

//swap pivot with neighbor

arr[pInd] = arr[pInd+1];

arr[pInd+1] = pivot;

//now switch the neighbor with the current val

temp = arr[pInd];

arr[pInd] = arr[i];

arr[i] = temp;

//iterate index, move on

pInd++;

}

}

//test

cout << "left values:\n";

for (int i = left; i < pInd; i++) cout << arr[i] << endl;

cout << "pivot value: " << pivot << endl;

cout << "right values:\n";

for (int i = pInd+1; i <= right; i++) cout << arr[i] << endl;

//divide and conquer based on the pivot index.

qSHelper(arr, left, pInd-1);

qSHelper(arr, pInd+1, right);

for (int i = 0; i < length; i++) cout << arr[i] << endl;

qSHelper(arr, 0, length-1);

if (num_.size() <1) return 0;

bool neg = false;

if (num_.at(0) == '-') neg = true;

int val = 0;

for (int i = 1; i < num_.size(); i++) {

val *=10;

val += (int)num_.at(i);

}

if (neg) return -1*val;

return val;

istringstream myS(phrase);

string temp;

string ans = "";

while(myS) {

myS >> temp;

cout << temp << endl;

ans = temp + " " + ans;

}

phrase = ans;

if (two.size() < one.size()) return false;

for (int i = 0; i < two.size()-one.size(); i++) {

if (one == two.substr(i,one.size() )) return true;

}

return false;

if (isSub("bat", "batman")) cout << "bat is a substr of batman" << endl;

else cout << "bat is not a substr of batman" << endl;

if (isSub("tab", "tannery")) cout <<"tab is a substr of tannery" <<endl;

else cout << "tab is not a substr of tannery" << endl;

cout << atoi("-12345") << endl;

string oc = "MC Sucker Has to Pay";

cout << oc << endl;

reverseWords(oc);

cout << oc << endl;

//see REF: mazeNode

//given an input of 0's and 1's defining a maze structre and a root of id=0 and GOAL of id=rand, find the shortest path to goal.

/* 1's are passable, 0's are not.

//foobar2 * fb3 = new foo;

/*