code: private boolean sort() {
  		// We cache all variables for faster access
  		final int[] d = this.d;
  		//System.err.println("Visiting...");
  		if (LOGGER.isDebugEnabled()) LOGGER.debug("Peeling hypergraph...");
  
  		top = 0;
  		for(int i = 0; i < numVertices; i++) if (d[i] == 1) peel(i);
  
  		if (LOGGER.isDebugEnabled()) LOGGER.debug(top == numEdges ? "Peeling completed." : "Visit failed: peeled " + top + " edges out of " + numEdges + ".");
  
  		return top == numEdges;
  	}
docs: Sorts the edges of a random 3-hypergraph in &ldquo;leaf peeling&rdquo; order.
  
  @return true if the sorting procedure succeeded.