/usr/include/oce/GraphTools_DFSIterator.gxx is in liboce-foundation-dev 0.15-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | // Created on: 1992-10-12
// Created by: Denis PASCAL
// 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_NoMoreObject.hxx>
#include <Standard_NoSuchObject.hxx>
#include <TColStd_StackOfInteger.hxx>
//=======================================================================
//function : GraphTools_DFSIterator
//purpose :
//=======================================================================
GraphTools_DFSIterator::GraphTools_DFSIterator () {}
//=======================================================================
//function : Perform
//purpose :
//=======================================================================
void GraphTools_DFSIterator::Perform
(const Graph& G, const Vertex& V)
{
Standard_Integer index;
myVisited.Clear();
TColStd_StackOfInteger myReady;
index = myVisited.Add(V);
myReady.Push(index);
while (!myReady.IsEmpty()) {
Vertex w1 = myVisited (myReady.Top());
myReady.Pop();
for (VIterator it(G,w1); it.More(); it.Next()) {
Vertex w2 = it.Value();
if (!myVisited.Contains(w2)) {
index = myVisited.Add(w2);
myReady.Push(index);
}
}
}
myCurrentIndex = 1;
}
//=======================================================================
//function : More
//purpose :
//=======================================================================
Standard_Boolean GraphTools_DFSIterator::More () const
{
return myCurrentIndex <= myVisited.Extent();
}
//=======================================================================
//function : Next
//purpose :
//=======================================================================
void GraphTools_DFSIterator::Next ()
{
myCurrentIndex++;
}
//=======================================================================
//function : Value
//purpose :
//=======================================================================
const Vertex& GraphTools_DFSIterator::Value () const
{
return myVisited(myCurrentIndex);
}
|