#include "Graph.h"

#include <algorithm>

#include <iostream>

void Graph::addNode(string nodeVal) {

Node *n = new Node(nodeVal);

nodes.insert(n);

}

void Graph::addUndirectedEdge(Node *first, Node *second) {

first->neighbors[second] = 1;

second->neighbors[first] = 1;

}

void Graph::removeUndirectedEdge(Node *first, Node *second) {

first->neighbors.erase(second);

second->neighbors.erase(first);

}

Node *Graph::getNode(string name) {

for (auto it = nodes.begin(); it != nodes.end(); it++)

if ((*it)->name.compare(name) == 0)

return *it;

}

void Graph::printGraph() {