#
void digraph::addNode(int n, int a)
#
{
#
        node foundNode;
#
        node adjacentNode;
#       vector<node>::iterator* i;
 
#
        for(i = graphNodes.begin(); i != graphNodes.end(); i++)
#
        {
#
                if(i->getKey() == n)
#
                {
#
                        foundNode = *i;
#               // or foundNode = i;
                }
#
        }