/****************************88 main.cpp *******************************************/ #include #include "Graph.h" using namespace std; int main() { int size; cout << "Cantidad de nodos a insertar? "; cin >> size; Graph graph(size); cin.clear(); cin.ignore(); for(int i = 0; i < size; i++) { string origen, destino; cout << "Inserte el origen: "; getline(cin, origen); cout << "Inserte el destino: "; getline(cin, destino); graph.insertEdge(origen, destino); } cout << "Grafo: \n"; cout << graph.toString() << '\n'; return 0; } /****************************88 Graph.h *******************************************/ #ifndef GRAPH_H #define GRAPH_H #include #include #include #include class Node { private: std::string name; public: Node(const std::string &n); void setName(const std::string &name); std::string getName() const; }; class Edge { private: Node *source; Node *destination; public: Edge(Node *source, Node *destination); Node* getA() const; Node* getB() const; }; class Graph { private: int size; std::vector graph; public: Graph(int size); void insertEdge(const std::string &source, const std::string &destination); std::string toString(); }; /************ Node implementation. ************/ Node::Node(const std::string &n) : name(n) { } //void Node::setName(const std::string n) { name = n; } std::string Node::getName() const { return name; } /************ Edge implementation. ************/ Edge::Edge(Node *source, Node *destination) : source(source), destination(destination) { } Node* Edge::getA() const { return source; } Node* Edge::getB() const { return destination; } /************ Graph implementation. ************/ Graph::Graph(int s) : size(s) { } void Graph::insertEdge(const std::string &source, const std::string &destination) { Node s(source); Node d(destination); Edge sd(&s, &d); graph.push_back(&sd); } std::string Graph::toString() { std::string str; std::vector::iterator it; for(it = graph.begin(); it != graph.end(); it++) { Edge *edge = *it; // HERE IT SEEMS TO BE THE PROBLEM. edge->getA()->getName(); str += "--> "; str += edge->getB()->getName(); } return str; } #endif

symple graph C++ (error printing)