![]() |
Fréchet View
1.6.0
A Tool for Exploring Fréchet Distance Algorithms
|
Go to the source code of this file.
Classes | |
class | frechet::reach::Graph |
Represents a Reachability Graph. Vertices correspond to intervals in the reachability structure, broken down to the most fine-grained intervals. More... | |
struct | frechet::reach::Graph::Origin |
How was this graph constructed? This info is useful for visualisation & debugging. And for constructing a topologoically sorted list of tasks. (see frechet::poly::AlgorithmTopoSort). More... | |
Namespaces | |
frechet | |
global definitions for all algorithms. | |
frechet::reach | |
class for computing reachability structures and graphs. | |
Typedefs | |
typedef boost::shared_ptr< Graph > | frechet::reach::GraphPtr |
Functions | |
GraphPtr | frechet::reach::newGraph (const GraphModel::ptr model) |
GraphPtr | frechet::reach::newGraph (const GraphModel::ptr model, IndexRange hmask) |
GraphPtr | frechet::reach::newGraph (const GraphModel::ptr model, Structure &str) |