#include typedef int Weight ; class Graph ; class Edge ; class Node ; ////////////////////////////////////////////////////////// main(){ cout << "THIS IS THE BEGINNING! \n"; // Insert main cout << "THIS IS THE END, MY FRIEND. \n"; } ////////////////////////////////////////////////////////// class Graph { public: // read file void readFile(); // create an edge with or without a weight (defaul is 0 weight) void setEdge(Node * from, Node* to ); void setEdge(Node * from , Node* to, Weight w ); // retrieve and edge Edge* getEdge(Node * from, Node* to ); // print graph in form of list of ndjacent nodes for // for each node // node_k : 4, 6, 9 void print(); private: Node *nodeArray; } //////////////////////////////////////////////////////////////// class Node { public: // constructor Node(int n); // print node and adjacent nodes printAll(); private: int id; Edge *edgeList; } //////////////////////////////////////////////////// class Edge { public: // return the id of the "to" node int getToNodeId(); private: Node *from; // they do not have to be pointers - up to you Node *to; Edge *next; Weight weight; }