cusack.hcg.games.pebble.algorithms.mergePebbles

Class PebbleList

java.lang.Object

cusack.hcg.games.pebble.algorithms.mergePebbles.PebbleList

public class PebbleList
extends java.lang.Object

A list that stores Composite Pebbles. It does not allow the placement of a pebble that is worse than a pebble already on the list.

Author:

Chuck

Constructor Summary

Constructors

Constructor and Description
PebbleList(int degree)

Method Summary

Modifier and Type	Method and Description
void	addPebble(CompositePebble cp) Add the pebble without checking whether or not it is better/worse than anything already on the list.
void	clear()
java.util.ArrayList<CompositePebble>	getPebbles()
boolean	hasUnprocessedPebble()
boolean	isPermissible(CompositePebble cp) Return true if and only if there is no pebble P in the current list that is better than cp.
void	markUnprocessedAllPebblesWithSourceFromSpecifiedVertex(int vertexIndex) This method will be called by IsSolveableMergePebbles.
java.util.ArrayList<CompositePebble>	processNext() Combine the first unprocessed pebble with all of the processed pebbles AND with itself.
void	removeCompositePebble(CompositePebble toRemove)
int	size()
java.lang.String	toString()
boolean	tryToAddPebble(CompositePebble cp) Attempt to add the CompositePebble cp to the list.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

PebbleList

public PebbleList(int degree)

Parameters:

pebbleList -

Method Detail

getPebbles

public java.util.ArrayList<CompositePebble> getPebbles()

removeCompositePebble

public void removeCompositePebble(CompositePebble toRemove)

clear

public void clear()

size

public int size()

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object

isPermissible

public boolean isPermissible(CompositePebble cp)

Return true if and only if there is no pebble P in the current list that is better than cp. Oh, except if the vertex has degree 1. In that case it returns true iff there are no pebbles because once there is one pebble on the vertex there is no point to adding others (because we won't ever move them from the vertex) so ignore them.

Parameters:

cp -

Returns:

tryToAddPebble

public boolean tryToAddPebble(CompositePebble cp)

Attempt to add the CompositePebble cp to the list. If it succeeds, it will remove from the list any pebble that is worse than cp. It will fail and return false if isPermissible(cp) is false.

Parameters:

cp -

Returns:

addPebble

public void addPebble(CompositePebble cp)

Add the pebble without checking whether or not it is better/worse than anything already on the list.

Parameters:

cp -

hasUnprocessedPebble

public boolean hasUnprocessedPebble()

processNext

public java.util.ArrayList<CompositePebble> processNext()

Combine the first unprocessed pebble with all of the processed pebbles AND with itself. Increment the firstProcessed counter and return an ArrayList containing all of the legal mergers with the first unprocessed pebble with each processed pebble and with itself. If there are not unprocessed return an empty list (which can also happen if there are no legal mergers).

Returns:

markUnprocessedAllPebblesWithSourceFromSpecifiedVertex

public void markUnprocessedAllPebblesWithSourceFromSpecifiedVertex(int vertexIndex)

This method will be called by IsSolveableMergePebbles. It is designed for an attempt to optimize PebblingNumberBottomUp by not rerunning a Merge pebbles algorithm each time a pebble is added. Instead, one pebble will be added to the graph, this method will mark pebbles whose source contains the vertex with the new pebble as permissible, and run doMergers again. by Aaron Green, Fall 2016

Parameters:

vertexIndex - The index of the vertex that gained a pebble.