Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

Graphs
AttributeGXL	Attribut servant de format de transfert entre un Label et sa lecture/écriture dans un fichier GXL.
Edge	Modélise un arc ou une arête d'un graphe.
GenericLabel
Graph	Modélise un graphe.
GraphComponent
GraphDisplay
IGraphDistance
IGraphMatching
IIsomorphism
IOGraph
ISubGraphIsomorphism
Label	Permet d'attribuer des valeurs à un noeud ou à un arc. Cette classe doit être héritée par l'utilisateur de la librairie pour la spécifier et ainsi l'utiliser dans son étude. Il est important que tous les Node aient le même type de Label, idem pour les Edge.
Node	Modélise un noeud d'un graphe.
UnLabelEdge
UnLabelNode
GraphSpeedTest
Matching
BeamSearch
Combinations< T >	Combinations defines a meta-collection, typically a list of lists, of all possible subsets of a particular size from the set of values. This list is enumerable and allows the scanning of all possible combinations using a simple foreach() loop. Within the returned set, there is no prescribed order. This follows the mathematical concept of choose. For example, put 10 dominoes in a hat and pick 5. The number of possible combinations is defined as "10 choose 5", which is calculated as (10!) / ((10 - 5)! * 5!).
Enumerator	The enumerator that enumerates each meta-collection of the enclosing Combinations class.
IMetaCollection< T >	Interface for Permutations, Combinations and any other classes that present a collection of collections based on an input collection. The enumerators that this class inherits defines the mechanism for enumerating through the collections.
Permutations< T >	Permutations defines a meta-collection, typically a list of lists, of all possible orderings of a set of values. This list is enumerable and allows the scanning of all possible permutations using a simple foreach() loop. The MetaCollectionType parameter of the constructor allows for the creation of two types of sets, those with and without repetition in the output set when presented with repetition in the input set.
Enumerator	The enumerator that enumerates each meta-collection of the enclosing Permutations class.
SmallPrimeUtility	Utility class that maintains a small table of prime numbers and provides simple implementations of Prime Factorization algorithms. This is a quick and dirty utility class to support calculations of permutation sets with indexes under 2^31. The prime table contains all primes up to Sqrt(2^31) which are all of the primes requires to factorize any Int32 positive integer.
Variations< T >	Variations defines a meta-collection, typically a list of lists, of all possible ordered subsets of a particular size from the set of values. This list is enumerable and allows the scanning of all possible Variations using a simple foreach() loop even though the variations are not all in memory.
EnumeratorWithoutRepetition	An enumerator for Variations when the type is set to WithoutRepetition.
EnumeratorWithRepetition	An enumerator for Variations when the type is set to WithRepetition.
EditPath
GraphEditDistance
IsomorphismCandG	Implémentation de l'algorithme de Corneil et Gotlieb permettant de savoir si un graphe est isomorphe ou sous-graphe d'un autre.
Labels	Labels hérite de Label et contient une liste de Label. Il permet de représenter les Label du graphe qui sont contenus dans un noeud de l'arbre de recherche SearchTree.
ResultIsomorphism	Résultat d'un test d'isomorphisme. Cet objet permet de savoir si le graphe est sous graphe de l'autre, si le graphe et isomorphe à l'autre, et de connaître la profondeur maximale des noeuds explorés.
SearchTree	L'arbre de recherche est un graphe qui est toujours orienté.
Vf	Implémente l'algorithme VF de Cordella servant à déterminer l'isomorphisme entre deux graphes.