searchvertexuos.java

国外的数据结构与算法分析用书

/* SearchVertexUos.java
 * ---------------------------------------------
 * Copyright (c) 2001 University of Saskatchewan
 * All Rights Reserved
 * --------------------------------------------- */
 
package dslib.graph;

/**	A searchable vertex that can be marked reached or not. */
public class SearchVertexUos extends VertexUos
{
	/**	Has this vertex been reached?. */
	protected boolean reached = false;

	/**	Construct a new vertex, store n and id as the vertex's name and index. <br>
		Analysis: Time = O(1)
		@param n name of the new vertex
		@param id index of the new vertex */
	public SearchVertexUos (String n, int id)
	{
		super(n, id);
	}

	/**	Has this vertex been reached?. <br> 
		Analysis: Time = O(1) */
	public boolean reached()
	{
		return reached;
	}

	/**	Set the reached value of this vertex. <br>
		Analysis: Time = O(1) */
	public void setReached(boolean newReached)
	{
		reached = newReached;
	}

}