Module traits 

this module implements additional traits for defining algorithmic operators on hypergraphs.

Traits

GraphOperator

this trait is used to denote an algorithmic operator that can be applied to a hypergraph.

GraphSearch

The GraphSearch trait is an automatically implemented trait for types that implement both the Search and Traversal traits indicating it can successfully perform a search on some graph structure while also allowing traversal of the graph.

GraphicAlgorithm

this trait is used to denote an algorithm that can be applied to a hypergraph

Heuristic

Heuristic defines a common interface for heuristic functions compatible with the A* search implementation

PathFinder

The PathFinder establishes an interface for path-finding operators on hypergraphs. Each implementor will provide a particular algorithm for finding paths between any two vertices in a hypergraph.

Search

The Search establishes a common interface for operators on hypergraphs capable of performing a search.

Traversal

Traversal trait defines an interface for operators capable of traversing some type, which in this case is a hypergraph.