Deep copy of my graph implementation

[DrJones]

Hi guys..
I trying to debug my graph implementation, and have come to the conclusion that my copy of my graph isn't done properly .. So how do i do it?

The copy is needed to compute a new state based on the previous state.

When i compare the memory address of an adjacent node in a vertex, with the node itself in the graph, its obvious that they aren't the same, and therefore changing something on a adjacent node, doesn't change anything on the node itself.

I need to implement some form of deep copying, but don't know how as I have nested structs and so on, shallow copying is what i've been doing until now, which clearly failed..

Here is my implementation

struct vertex
{
   Node *current;
   Node *adjacent;

};

struct node
{
    char town;
    vector<vertex> neighbours;
};


class graph{
public:
    graph();
    graph(const graph &obj);
    int row;
    int col;
    char **map;
    vector<Node> roadmap; //Being the graph
    graph(std::string file);