CADS

Packages
	Cell_complex_shelling_diagram
	Under Construction. Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus
	D_family_matching
	Computing matchings between clusters of clusters with diameter constraints. Reference Manual – User Manual . Authors: R. Tetley and F. Cazals and D. Mazauric
	Dijkstra_shortest_paths_with_landmarks
	Under Construction. Reference Manual – User Manual . Authors: F. Cazals and T.Dreyfus and A. Lheritier
	Directed_acyclic_graph
	Data structure representing a Directed Acyclic Graph (DAG) Reference Manual – User Manual . Authors: F. Cazals and T.Dreyfus
	Earth_mover_distance
	Earth mover distance solver Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus and D. Mazauric
	Greedy_selection
	Algorithms for a greedy selection of arrangements of cells minimizing their overlaps. Reference Manual – User Manual . Authors: F. Cazals and T.Dreyfus
	Maximum_clique
	Algorithm computing a maximum clique of an input graph. Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus and N. Malod-Dognin
	Minimal_oriented_spanning_forest
	Algorithm for computing the Minimal Spanning Forest of a graph. Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus and D. Mazauric
	Ordered_forest_edit_distance
	Algorithm computing the distance between two graphs by morphing the source graph to the target graph. Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus and N. Malod-Dognin
	Product_graph
	Data structures for building the product graph of two input graphs Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus
	Specialized_iterators
	Iterators over different kind of containers Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus
	Union_find
	Enriched Union-Find data structure for maintaining the number of connected components of a set of data Reference Manual – User Manual . Authors: F. Cazals and T. Dreyfus

Description

Combinatorial Algorithms and Data Structures.

Various operations on the molecular geometric models manipulated in the SBL require combinatorial data structures and operations on them. The CADS set of packages provides such data structures and algorithms. The former category provides representations for trees and forests, directed acyclic graphs, Union Find data structures, and shelling diagrams. The latter category provides algorithms on these data structures.