1 // Created on: 1991-05-29
2 // Created by: Denis PASCAL
3 // Copyright (c) 1991-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.
20 //=======================================================================
21 //function : GraphTools_TopologicalSortIterator
23 //=======================================================================
25 GraphTools_TopologicalSortIterator::GraphTools_TopologicalSortIterator ()
29 //=======================================================================
30 //function : GraphTools_TopologicalSortIterator
32 //=======================================================================
34 GraphTools_TopologicalSortIterator::GraphTools_TopologicalSortIterator
41 //=======================================================================
42 //function : FromVertex
44 //=======================================================================
46 void GraphTools_TopologicalSortIterator::FromVertex
49 myIterator.FromVertex(V);
53 //=======================================================================
54 //function : FromGraph
56 //=======================================================================
58 void GraphTools_TopologicalSortIterator::FromGraph
61 for ( GIterator it (G); it.More(); it.Next() ) {
62 myIterator.FromVertex(it.Value());
67 //=======================================================================
70 //=======================================================================
72 void GraphTools_TopologicalSortIterator::Perform
74 const Standard_Boolean ignoreSelfLoops,
75 const Standard_Boolean processCycle)
77 myIterator.Perform(G,ignoreSelfLoops,processCycle);
81 //=======================================================================
84 //=======================================================================
86 void GraphTools_TopologicalSortIterator::Reset ()
92 //=======================================================================
95 //=======================================================================
97 Standard_Boolean GraphTools_TopologicalSortIterator::More () const
99 return myIterator.More();
103 //=======================================================================
106 //=======================================================================
108 void GraphTools_TopologicalSortIterator::Next ()
114 //=======================================================================
117 //=======================================================================
119 const Vertex& GraphTools_TopologicalSortIterator::Value () const
121 return myIterator.Value();
125 //=======================================================================
126 //function : IsInCycle
128 //=======================================================================
130 Standard_Boolean GraphTools_TopologicalSortIterator::IsInCycle () const
132 return myIterator.IsInCycle();