package holeg;

public enum SlackNodePlacementStrategy {
    /**
     * The first node is always replaced as a slack node. The grid is only solved once.
     */
    FirstNode,
    /**
     * A random node is chosen as the slack node. The grid is solved multiple times.
     */
    RandomNode,
    /**
     * A random producer is chosen as the slack node. The grid is solved multiple times.
     */
    RandomProducer,
    /**
     * The largest producer is chosen as the slack node. The grid is only solved once.
     */
    LargestProducer,
    /**
     * The largest consumer is chosen as the slack node. The grid is only solved once.
     */
    LargestConsumer,
    /**
     * The grid is solved multiple times. For each try another node is the slack node. The minimum solution to
     * the problem in terms of the slack power is chosen as the final solved grid.
     */
    MinimizeSlack
}