+++ /dev/null
--- Created on: 1991-10-23
--- Created by: Denis PASCAL
--- Copyright (c) 1991-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 License 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.
-
-generic class SortedStrgCmptsFromIterator from GraphTools
- (Graph as any;
- Vertex as any;
- VHasher as any;
- VIterator as any)
-
- ---Purposes: This generic class implements the Strong Components
- -- Research algorithm from a set of vertices. An
- -- iterator on adjacent vertices of a given one, are
- -- requested. Each Strong Component encapsulates
- -- vertices which are part of a cycle, in the underlying
- -- graph. The interface of this algorithm is made as an
- -- iterator. A each step it is possible to know the
- -- number of vertices, which are members of the current
- -- Strong Components, and to visit each one. Strong
- -- Components are visited in such an order than noone is
- -- returned before an other which point to it.
-
-
-uses ListOfInteger from TColStd,
- ListOfSequenceOfInteger from GraphTools,
- ListIteratorOfListOfSequenceOfInteger from GraphTools
-
-raises NoMoreObject from Standard,
- NoSuchObject from Standard,
- DomainError from Standard
-
-
- private class SCMap instantiates IndexedDataMap from TCollection
- (Vertex,Integer,VHasher);
-
-is
-
- Create
- ---Purpose: Create an empty algorithm.
- returns SortedStrgCmptsFromIterator from GraphTools;
-
- FromVertex (me : in out; V : Vertex)
- ---Purpose: Add <V> as initial condition. This method is
- -- cumulative. Use Perform method before visting the
- -- result of the algorithm.
- ---Level: Public
- raises DomainError from Standard;
-
- Reset (me : in out);
- ---Purpose: Reset the algorithm. It may be reused with new
- -- conditions.
- ---Level: Public
-
- Perform (me : in out; G : Graph);
- ---Purpose: Peform the algorithm in <G> from initial setted
- -- conditions.
- ---Level: Public
-
- More(me)
- returns Boolean from Standard;
- ---Purpose: returns True if there are others strong
- -- components.
- ---Level: Public
-
- Next(me : in out)
- ---Purpose: Set the iterator to the next strong component.
- ---Level: Public
- raises NoMoreObject from Standard;
-
- NbVertices (me)
- returns Integer from Standard
- ---Purpose: Returns number of vertices of the current Strong
- -- Components.
- ---Level: Public
- raises NoSuchObject from Standard;
-
- Value(me; index : Integer from Standard)
- returns any Vertex
- ---Purpose: returns the vertex of index <I> of the current
- -- Strong Component.
- ---Level: Public
- ---C++: return const &
- raises NoSuchObject from Standard;
-
- Visit (me : in out; k : Integer from Standard;
- G : Graph)
- ---Level: Internal
- returns Integer from Standard;
-
-fields
-
--- conditions
- myVertices : SCMap from GraphTools;
--- algorithm
- myNowIndex : Integer from Standard;
- myStack : ListOfInteger from TColStd;
--- result
- mySort : ListOfSequenceOfInteger from GraphTools;
- myIterator : ListIteratorOfListOfSequenceOfInteger from GraphTools;
-
-end SortedStrgCmptsFromIterator;
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
projects / occt.git / blobdiff