1 // Created on: 1992-10-12
2 // Created by: Denis PASCAL
3 // Copyright (c) 1992-1999 Matra Datavision
4 // Copyright (c) 1999-2012 OPEN CASCADE SAS
6 // The content of this file is subject to the Open CASCADE Technology Public
7 // License Version 6.5 (the "License"). You may not use the content of this file
8 // except in compliance with the License. Please obtain a copy of the License
9 // at http://www.opencascade.org and read it completely before using this file.
11 // The Initial Developer of the Original Code is Open CASCADE S.A.S., having its
12 // main offices at: 1, place des Freres Montgolfier, 78280 Guyancourt, France.
14 // The Original Code and all software distributed under the License is
15 // distributed on an "AS IS" basis, without warranty of any kind, and the
16 // Initial Developer hereby disclaims all such warranties, including without
17 // limitation, any warranties of merchantability, fitness for a particular
18 // purpose or non-infringement. Please see the License for the specific terms
19 // and conditions governing the rights and limitations under the License.
22 #include <Standard_NoMoreObject.hxx>
23 #include <Standard_NoSuchObject.hxx>
24 #include <TColStd_StackOfInteger.hxx>
26 //=======================================================================
27 //function : GraphTools_DFSIterator
29 //=======================================================================
31 GraphTools_DFSIterator::GraphTools_DFSIterator () {}
34 //=======================================================================
37 //=======================================================================
39 void GraphTools_DFSIterator::Perform
40 (const Graph& G, const Vertex& V)
42 Standard_Integer index;
44 TColStd_StackOfInteger myReady;
46 index = myVisited.Add(V);
48 while (!myReady.IsEmpty()) {
49 Vertex w1 = myVisited (myReady.Top());
51 for (VIterator it(G,w1); it.More(); it.Next()) {
52 Vertex w2 = it.Value();
53 if (!myVisited.Contains(w2)) {
54 index = myVisited.Add(w2);
63 //=======================================================================
66 //=======================================================================
68 Standard_Boolean GraphTools_DFSIterator::More () const
70 return myCurrentIndex <= myVisited.Extent();
74 //=======================================================================
77 //=======================================================================
79 void GraphTools_DFSIterator::Next ()
85 //=======================================================================
88 //=======================================================================
90 const Vertex& GraphTools_DFSIterator::Value () const
92 return myVisited(myCurrentIndex);