STL - vector

vector<Edge> graph;

graph.push_back( Edge() );

graph.push_back( Edge() );

graph.push_back( Edge() );

vector<Edge>::Iterator iter;

for( iter = graph.begin(); iter != graph.end(); ++iter )

    cout<< iter->key << endl;

sort(graph.begin(), graph.end(), less<Edge>());