[ Reference Manual | Alphabetic Index ]

# library(visualize_tree)

Entry point for VIZ visualisation tools

## Predicates

> extract_array(+Handle, ++RowCol, +Matrix, -List)
>   Convert a matrix into a list for search inside a visualization
> extract_array(+Handle, ++RowCol, ++Group, +Matrix, -List)
>   Convert a matrix into a list for search inside a visualization
> failure(+Handle, ++Name, ++Size, ++Value)
>   Create a fail node for the search tree
> failure_c(?, ?, ?, ?)
>   No description available
> name_variables(+Handle, +L, ++Names, -Terms)
>   Create a list of terms for a search routine, naming the variables with strings
> name_variables(+Handle, +L, ++Names, ++Group, -Terms)
>   Create a list of terms for a search routine, naming the variables with strings
> number_variables(+Handle, +L, -Terms)
>   Create a list of terms for a search routine, numbering the variables
> number_variables(+Handle, +L, +Group, -Terms)
>   Create a list of terms for a search routine, numbering the variables
> root(+Handle)
>   Create the root node of a search tree
> solution(+Handle)
>   Create a solution node for a search tree
> tree_indomain(+Term, +Handle, ?HandleOut)
>   Primitive to assign a variable while creating a search tree
> tree_indomain_max(+Term, +Handle, ?HandleOut)
>   Primitive to assign a variable while creating a search tree
> tree_indomain_middle(+Term, +Handle, ?HandleOut)
>   Primitive to assign a variable while creating a search tree
> tree_indomain_min(+Term, +Handle, ?HandleOut)
>   Primitive to assign a variable while creating a search tree
> tree_indomain_random(+Term, +Handle, ?HandleOut)
>   Primitive to assign a variable while creating a search tree
> try(+Handle, ++Name, ++Size, ++Value)
>   Create a try node for the search tree
> try_c(?, ?, ?, ?)
>   No description available

## Reexports

> reexport visualization

## About

- Status: experimental
- Author: Helmut Simonis
- Copyright © 2010, Helmut Simonis

Generated from visualize_tree.eci on 2022-09-03 14:26