public void dispose()
{
if (m_pStopPoint != null)
{
m_pStopPoint = null;
}
}
public void dispose()
{
if (m_pStopPoint != null)
{
m_pStopPoint = null;
}
}
public void addStopPoint(int nx, int ny, StopPoint pStopPoint)
{
int vertId = convXYToVertId(nx, ny);
m_vertsVec[vertId].m_pStopPoint = pStopPoint;
setNeighborInvalidByVertId(vertId);
}
public void reset()
{
//m_id = 0;
m_state = State.Unknown;
m_nearestVert = null;
m_distance = float.MaxValue;
m_bNeighborValid = false;
m_pStopPoint = null;
m_vertsIdVec.Clear();
}
public void reset()
{
//m_id = 0;
m_state = State.Unknown;
m_nearestVert = null;
m_distance = float.MaxValue;
m_bNeighborValid = false;
m_pStopPoint = null;
m_vertsIdVec.Clear();
}
// ²âÊÔ 1 ¸ö×èµ²µã
public List<Vertex> test1Stop(MGraph pMGraph)
{
StopPoint pStopPoint = null;
pStopPoint = new StopPoint();
pMGraph.addStopPoint(1, 0, pStopPoint);
List<Vertex> vertList;
if (pMGraph.isPathCacheValid(0, 8))
{
vertList = pMGraph.getShortestPathFromPathCache(0, 8);
}
else
{
vertList = pMGraph.getOrCreateShortestPath(0, 8);
}
return vertList;
}
public void addStopPoint(int nx, int ny, StopPoint pStopPoint)
{
int vertId = convXYToVertId(nx, ny);
m_vertsVec[vertId].m_pStopPoint = pStopPoint;
setNeighborInvalidByVertId(vertId);
}