|
The Conley-Morse Graphs Software
|
Map computation routines using tight enclosures (not necessarily products of intervals). More...
#include <iostream>#include <fstream>#include <algorithm>#include <memory>#include <new>#include "chomp/system/textfile.h"#include "chomp/system/timeused.h"#include "chomp/struct/autoarray.h"#include "chomp/struct/digraph.h"#include "config.h"#include "typedefs.h"#include "typeintv.h"#include "mapdist.h"#include "mapcomp.h"#include "coverrect.h"#include "utils.h"Go to the source code of this file.
Classes | |
| class | MapComputationTight< mapcomp, cubetype, cubsettype > |
| The generic map computation routine that computes a rigorous cubical multivalued map based on a function that computes the image of an interval vector as a rectangular set. More... | |
Map computation routines using tight enclosures (not necessarily products of intervals).
This file contains the definition of routines for the computation of combinatorial cubical multivalued maps.
Definition in file mapcomp_t.h.