returns true if the target node has been located

----------------------------- Fuzzify --------------------------------------- this method calls the Fuzzify method of the variable with the same name

--------------------------- Fuzzify ----------------------------------------- takes a crisp value and calculates its degree of membership for each se

////////////////////////////////////////////////////////////////////////// implementation of FzAND /////////////////////////////////////////////////

prevent copying and assignment

////////////////////////////////////////////////////////////////////////// implementation of FzOR //////////////////////////////////////////////////

prevent copying and assignment by clients

gets the coordinates of the cursor relative to an active window

returns the total cost to the target

returns the total cost to the target

returns how much time has elapsed since the timer was started

--------------------------- GetDOM ------------------------------------------ the AND operator returns the minimum DOM of the sets it is operating on

------------------- GetLineSegmentCircleClosestIntersectionPoint ------------ given a line segment AB and a circle position and radius, this function

only ever used during debugging to grab the name of the current state

helper methods. They convert the next parameter value found into the relevant type

--------------------------- GetNextToken ------------------------------------ ignores any commenting and gets the next string -----------------------

use this to grab the next valid ID

if a graph node is removed, it is not removed from the vector of nodes (because that would mean changing all the indices of all the nodes that have a

if a graph node is removed or switched off, it is not removed from the vector of nodes (because that would mean changing all the indices of all the no

-------------------------- GetRayCircleIntersec -----------------------------

returns the vector of edges that defines the SPT. If a target was given in the constructor then this will be an SPT comprising of all the nodes examin

returns a vector containing pointers to all the edges the search has examined

returns a vector containing pointers to all the edges the search has examined

------------------------------------------------------------------------ Given a point P and a circle of radius R centered at C this function determin

------------------------- GetWindowHeight ----------------------------------- ------------------------------------------------------------------------

------------------------- GetWindowWidth ----------------------------------- ------------------------------------------------------------------------

note how goals start off in the inactive state

Create a graph with an initial capacity of 16 nodes.

Create a graph with an initial capacity of 16 nodes.

Make protected to prevent its use outside the class.

Make protected to prevent its use outside the class.

ctors

@param aFile

Create a search object that uses the A algorithm for the given graph. <br> By default it uses the crow-flies heuristic. <br> @param graph the graph to

Create a search object that uses the A algorithm for the given graph. <br> By default it uses the crow-flies heuristic. <br> @param graph the graph to

Prevent creating an object without a graph

Prevent creating an object without a graph

Prevent creating an object without a graph

Prevent creating an object without a graph

Create a search object that uses Dijkstra's algorithm for the given graph. @param graph the graph to use

Create a search object that uses Dijkstra's algorithm for the given graph. @param graph the graph to use