iterator trouble

Hej, jeg har f'lgende der returnerer en iterator over Edge*

EdgeList::const_iterator Graph::incidentEdges(Vertex* v) {
  EdgeList::const_iterator edg = v->getIncoming()->begin();
  EdgeList::const_iterator edg2 = v->getOutgoing()->begin();
  EdgeList* result = new EdgeList();
  while(v->getIncoming()->begin() != v->getIncoming()->end()) {
    result->push_back(*edg);
    ++edg;
  }
  while(v->getOutgoing()->begin() != v->getOutgoing()->end() ) {
    result->push_back(*edg2);
    ++edg2;
  }
  EdgeList::const_iterator incident = result->begin();
  return incident;
}

N[r jeg s[ vil bruge denne iterator som i f'lgende:
Graph* g = new Graph("G");
Vertex* v = g->insertVertex("v");

EdgeList::const_iterator iter3 = g->incidentEdges(v);
  while(*iter3) {
    std::cout << "incident edge " << (*iter3)->getName() << std::endl;
    ++iter3;
  }
giver den segmentation fault. Jeg regner med at det er fordi iteratoren kan v;re tom, men hvordan tester jeg for dette?