Method partition

SRC/graph/partitioner/MetisWrapper.cpp:199–346

//    vrtices are in. Returns -1 if options are not set, -2 if metis failed.

int
Metis::partition(Graph &theGraph, int numPart)
{
  // first we check that the options are valid
  if (checkOptions() == false)
    return -1;

  // now we get room for the data structures metis needs

  int numVertex = theGraph.getNumVertex();
  int numEdge = theGraph.getNumEdge();
    //    opserr << " Metis::partition --- numVertex: " << numVertex << " numEdge: "<<  numEdge << "\n";
  int *options = new int [5];
  int *partition = new int [numVertex + 1];
  int *xadj = new int [numVertex + 2];
  int *adjncy = new int [2 * numEdge];
  int *vwgts = 0;
  int *ewgts = 0;
  int numbering = 0;
  int weightflag = 0; // no weights on our graphs yet

  if (START_VERTEX_NUM == 0)
    numbering = 0;
  else if (START_VERTEX_NUM == 1)
    numbering = 1;
  else {
    opserr << "WARNING Metis::partition - No partitioning done";
    opserr << " vertex numbering must start at 0 or 1\n";
    return (-2);
  }
  int edgecut;

  if ((options == 0) || (partition == 0) || (xadj == 0) || (adjncy == 0)) {
    opserr << "WARNING Metis::partition - No partitioning done";
    opserr << " as ran out of memory\n";
    return (-2);
  }


  // we build these data structures

  int indexEdge = 0;
  xadj[0] = 0;

  Vertex *vertexPtr;
  for (int vertex = 0; vertex < numVertex; vertex++) {
    vertexPtr = theGraph.getVertexPtr(vertex + START_VERTEX_NUM);

    // check we don't have an invalid vertex numbering scheme
    // if so WARNING message, clean up and return -2

    if (vertexPtr == 0) {
      opserr << "WARNING Metis::partition - No partitioning done";
      opserr << " Metis requires consecutive Vertex Numbering\n";

      delete [] options;
      delete [] partition;
      delete [] xadj;