The OMMap class contains basic library functions that enable you to create and manipulate OMMaps. An OMMap is a type-safe map, based on a balanced binary tree (log(n) search time).
Consider a class, Graph, that has a bfs() operation that performs BFS search on the graph nodes to find a node with the specified data. The following figure shows the OMD of the Graph class.

The following figure shows the browser view of the Graph class.

The bfs() implementation uses OMQueue as the search container and OMMap as a record of the visited elements.
The following figure shows the implementation of Graph::bfs().

The following figure shows the implementation of Graph::Node::addAggregates().
