1 // Created on: 1992-10-12
2 // Created by: Denis PASCAL
3 // Copyright (c) 1992-1999 Matra Datavision
4 // Copyright (c) 1999-2014 OPEN CASCADE SAS
6 // This file is part of Open CASCADE Technology software library.
8 // This library is free software; you can redistribute it and/or modify it under
9 // the terms of the GNU Lesser General Public License version 2.1 as published
10 // by the Free Software Foundation, with special exception defined in the file
11 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12 // distribution for complete text of the license and disclaimer of any warranty.
14 // Alternatively, this file may be used under the terms of Open CASCADE
15 // commercial license or contractual agreement.
17 #include <Standard_NoMoreObject.hxx>
18 #include <Standard_NoSuchObject.hxx>
19 #include <TColStd_ListOfInteger.hxx>
21 //=======================================================================
22 //function : GraphTools_DFSIterator
24 //=======================================================================
26 GraphTools_DFSIterator::GraphTools_DFSIterator () {}
29 //=======================================================================
32 //=======================================================================
34 void GraphTools_DFSIterator::Perform
35 (const Graph& G, const Vertex& V)
37 Standard_Integer index;
39 TColStd_ListOfInteger myReady;
41 index = myVisited.Add(V);
42 myReady.Prepend(index);
43 while (!myReady.IsEmpty()) {
44 Vertex w1 = myVisited (myReady.First());
45 myReady.RemoveFirst();
46 for (VIterator it(G,w1); it.More(); it.Next()) {
47 Vertex w2 = it.Value();
48 if (!myVisited.Contains(w2)) {
49 index = myVisited.Add(w2);
50 myReady.Prepend(index);
58 //=======================================================================
61 //=======================================================================
63 Standard_Boolean GraphTools_DFSIterator::More () const
65 return myCurrentIndex <= myVisited.Extent();
69 //=======================================================================
72 //=======================================================================
74 void GraphTools_DFSIterator::Next ()
80 //=======================================================================
83 //=======================================================================
85 const Vertex& GraphTools_DFSIterator::Value () const
87 return myVisited(myCurrentIndex);