graph programming

help me out guys . i have the class declared below and i need help of how to delete adjacent nodes. here i am using list and vector algorithm (stl library);


typedef int datatype;

class GraphNode
{private:
datatype NodeVal;
list<datatype> AdjList;
public:
GraphNode(datatype);
void AddAdjNode(datatype);
void ShowNode();
void DeleteAdjnode(datatype);
friend class Graph;
};

class Graph
{private:
vector<GraphNode> Nodes;
public:
void deleteNode(datatype);
Last edited on
closed account (S6k9GNh0)
Wtf are you talking about.
Topic archived. No new replies allowed.