Graph Implementation in c++

vector<vector<string>> inputdata;
total_node =4;

class Node {
public:
		Node(string NodeId,string NodeName)
		{
			_nodeId = NodeId;
		}

		string GetNodeId()
		{
			return _nodeId;
		}

		void addAdjacentNode(Node *startNode, Node *dstNode, int cost)
		{
			Edge edge(startNode,dstNode,cost);
			_neighborEdge.push_back(edge);
		}

	private: 
		string _nodeId;
		vector <Edge> _neighborEdge;
	}


class Edge {

public:
	Edge(Node *startNode, Node *endNode, int weight)
	{
		originatingNodeId = startNode;
		destinationNodeId = endNode;
		cost = weight;
	}

private:
	Node *originatingNodeId;
	Node *destinationNodeId;
	int cost;
}

class Graph {
public:

	void addNode(Node *node)
	{
		graph.push_back(node);
	}

private:
	vector<Node*> graph;
}