Package

at.logic.gapt.utils.ds

trees

Permalink

package trees

Content Hierarchy
Visibility
  1. Public
  2. All

Type Members

  1. class ArbitraryTree[V] extends ArbitraryAGraph[V] with Tree[V] with NonTerminalNodeA[V, Unit]

    Permalink
  2. class BinaryTree[V] extends BinaryAGraph[V] with Tree[V] with NonTerminalNodeA[V, Unit]

    Permalink
  3. class LeafTree[V] extends LeafAGraph[V] with Tree[V] with TerminalNodeA[V, Unit]

    Permalink
  4. trait NonTerminalNodeA[+V, +E] extends TreeA[V, E]

    Permalink
  5. trait TerminalNodeA[+V, +E] extends TreeA[V, E]

    Permalink
  6. trait Tree[V] extends AGraph[V] with TreeA[V, Unit]

    Permalink

    Trees are constructed over the inductive graph type and are characterised by vertices not repeating in the leaves.

    Trees are constructed over the inductive graph type and are characterised by vertices not repeating in the leaves. they implement the TreeA interface. A simple datastrcuture for trees can be found in the algebraic package

  7. trait TreeA[+V, +E] extends AnyRef

    Permalink

    We first define the TreeA trait for trees

  8. class UnaryTree[V] extends UnaryAGraph[V] with Tree[V] with NonTerminalNodeA[V, Unit]

    Permalink

Ungrouped