INGOR
Loading...
Searching...
No Matches
Greedy Hill-Climbing Algorithm

Available arguments

t=n
The number of trials. The algorithm repeats this number of times, and returnts the best scored graph structure.
cache= [ on | off ]
Enables or disables the score cache.

INGOR Manual

Greedy