---

edgeVector.h

/****************************************************
 *  Bachelor Project:                               *
 *  External Memory Minimum Spanning Trees          *
 *  by Dominik Schultes <mail@dominik-schultes.de>  *
 *                                                  *
 *                edgeVector.h                      *
 *                                                  *
 *  April 13, 2003                                  *
 ****************************************************/


#ifndef EDGEVECTOR_H
#define EDGEVECTOR_H

#include <iostream>

#include "relabeledEdge.h"

#include "../stxxl/containers/vector.h"

typedef unsigned int EdgeCount;
typedef unsigned int NodeCount;


template <typename EdgeType = Edge,
          unsigned int blockSize = DS_DEFAULT_BLOCK_SIZE,
          unsigned int noOfPages = DS_DEFAULT_NO_OF_PAGES,
          unsigned int pageSize = DS_DEFAULT_PAGE_SIZE>
class EdgeVector : public stxxl::VECTOR_GENERATOR<EdgeType, pageSize, noOfPages,
                                                  blockSize>::result
{
    friend std::ostream& operator<<( std::ostream& os,
                                     EdgeVector<EdgeType,blockSize,noOfPages,pageSize> &el ) {
        os << el.noOfNodes() << " " << el.noOfEdges() << std::endl;
        for (EdgeCount i=0; i<el.noOfEdges(); i++)
            os << el[i] << std::endl;
        return os;
    }
    
 public:
    EdgeVector(NodeCount noOfNodes, EdgeCount noOfEdges)
        : _noOfNodes( noOfNodes )
        { reserve(noOfEdges); }

    EdgeCount noOfEdges() const {return size();}

    NodeCount noOfNodes() const {return _noOfNodes;}

    bool empty() const {return (noOfEdges() == 0);}

    
    void sortByWeight();
    
 private:
    NodeCount _noOfNodes;

};


typedef EdgeVector<RelabeledEdge> InternalMemoryBucket;


#endif // EDGEVECTOR_H

---