Class CycleBasis
- java.lang.Object
-
- org.openscience.cdk.ringsearch.cyclebasis.CycleBasis
-
@Deprecated public class CycleBasis extends Object
Deprecated.internal implemenation detail from SSSRFinder, do not useA minimum basis of all cycles in a graph. All cycles in a graph G can be constructed from the basis cycles by binary addition of their invidence vectors. A minimum cycle basis is a Matroid.- Author:
- Ulrich Bauer <ulrich.bauer@alumni.tum.de>
- Source code:
- main
- Belongs to CDK module:
- standard
-
-
Constructor Summary
Constructors Constructor Description CycleBasis(org._3pq.jgrapht.UndirectedGraph g)
Deprecated.Constructs a minimum cycle basis of a graph.
-
Method Summary
All Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method Description Collection
cycles()
Deprecated.Returns the cycles that form the cycle basis.List
equivalenceClasses()
Deprecated.Returns the connected components of this cycle basis, in regard to matroid theory.Collection
essentialCycles()
Deprecated.Returns the essential cycles of this cycle basis.Map
relevantCycles()
Deprecated.Returns the essential cycles of this cycle basis.int[]
weightVector()
Deprecated.
-
-
-
Method Detail
-
weightVector
public int[] weightVector()
Deprecated.
-
cycles
public Collection cycles()
Deprecated.Returns the cycles that form the cycle basis.- Returns:
- a
Collection
of the basis cycles
-
essentialCycles
public Collection essentialCycles()
Deprecated.Returns the essential cycles of this cycle basis. A essential cycle is contained in every minimum cycle basis of a graph.- Returns:
- a
Collection
of the essential cycles
-
relevantCycles
public Map relevantCycles()
Deprecated.Returns the essential cycles of this cycle basis. A relevant cycle is contained in some minimum cycle basis of a graph.- Returns:
- a
Map
mapping each relevant cycles to the corresponding basis cycle in this basis
-
equivalenceClasses
public List equivalenceClasses()
Deprecated.Returns the connected components of this cycle basis, in regard to matroid theory. Two cycles belong to the same commected component if there is a circuit (a minimal dependent set) containing both cycles.- Returns:
- a
List
ofSet
s consisting of the cycles in a equivalence class.
-
-