liboce-foundation-dev 0.15-4 / usr / include / oce / GraphTools_ConnectedVerticesFromIterator.gxx

// Created on: 1992-10-19
// Created by: Arnaud BOUZY
// Copyright (c) 1992-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and / or modify it
// under the terms of the GNU Lesser General Public version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.

#include <Standard_NoSuchObject.hxx>
#include <Standard_NoMoreObject.hxx>


//=======================================================================
//function : GraphTools_ConnectedVerticesFromIterator
//purpose  : 
//=======================================================================

GraphTools_ConnectedVerticesFromIterator::GraphTools_ConnectedVerticesFromIterator()
{
  myCurrent = 0;
}


//=======================================================================
//function : FromVertex
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::FromVertex(const Vertex& avert)
{
  initMap.Add(avert);
}


//=======================================================================
//function : Reset
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Reset ()
{
  myCurrent = 0;
  initMap.Clear();
}


//=======================================================================
//function : Perform
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Perform (const Graph& aGraph)
{
  Standard_Integer nbvert = initMap.Extent();
  GraphTools_ConnectMap visited;
  Standard_Integer i;
  for (i=1;i<=nbvert; i++) {
    visited.Bind(initMap(i),i);
  }
  for (i=1;i<=nbvert; i++) {
    if (visited(initMap(i)) == i) {
      myCurrent = i;
      VIterator vit(aGraph,initMap(i));
      while (vit.More()) {
	Visit(vit.Value(),aGraph,visited);
	vit.Next();
      }
    }
  }

  tab = new TColStd_HArray1OfInteger(1,nbvert,0);
  for (i=1; i<= nbvert; i++) {
    tab->SetValue(i,visited(initMap(i)));
  }
  myCurrent = 0;
  Next();
}


//=======================================================================
//function : More
//purpose  : 
//=======================================================================

Standard_Boolean GraphTools_ConnectedVerticesFromIterator::More() const
{
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) >= myCurrent) {
      return Standard_True;
    }
  }
  return Standard_False;
}


//=======================================================================
//function : Next
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Next()
{
  Standard_Boolean found=Standard_False;
  myCurrent++;
  Standard_Integer nbv = tab->Upper();
  Standard_Integer i;
  while (!found && (myCurrent <= nbv)) {
    for (i=1; (i<= nbv) && !found; i++) {
      if (tab->Value(i) == myCurrent) {
	found = Standard_True;
      }
    }
    if (!found) {
      myCurrent++;
    }
  }
}


//=======================================================================
//function : NbVertices
//purpose  : 
//=======================================================================

Standard_Integer GraphTools_ConnectedVerticesFromIterator::NbVertices() const
{
  if (!More()) {
    Standard_NoSuchObject::Raise();
  }
  Standard_Integer res = 0;
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) == myCurrent) {
      res++;
    }
  }
  return res;
}

//=======================================================================
//function : Value
//purpose  : 
//=======================================================================

const Vertex& GraphTools_ConnectedVerticesFromIterator::Value
  (const Standard_Integer index) const
{
  if (!More()) {
    Standard_NoSuchObject::Raise();
  }
  Standard_Integer current=0;
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) == myCurrent) {
      current++;
      if (current == index) {
	return initMap(i);
      }
    }
  }
}

//=======================================================================
//function : Visit
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Visit
  (const Vertex& avert,
   const Graph& agraph, 
   GraphTools_ConnectMap& visited)
{
  Standard_Boolean godown = Standard_False;
  if (!visited.IsBound(avert)) {
    visited.Bind(avert,myCurrent);
    godown = Standard_True;
  }
  else {
    Standard_Integer thebound = visited(avert);
    if (thebound > myCurrent) {
      visited(avert) = myCurrent;
      godown = Standard_True;
    }
    else if (thebound < myCurrent) {
      Standard_Integer rebind = visited(initMap(thebound));
      for (Standard_Integer i=1; i <= initMap.Extent(); i++) {
	if ((visited(initMap(i)) == thebound) || 
	    (visited(initMap(i)) == rebind)) {
	  visited(initMap(i)) = myCurrent;
	}
      }
    }
  }
  if (godown) {
    VIterator vit(agraph,avert);
    while (vit.More()) {
      Visit(vit.Value(),agraph,visited);
      vit.Next();
    }
  }
}