本文整理汇总了C++中ANode::nextNode方法的典型用法代码示例。如果您正苦于以下问题：C++ ANode::nextNode方法的具体用法？C++ ANode::nextNode怎么用？C++ ANode::nextNode使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ANode的用法示例。
在下文中一共展示了ANode::nextNode方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: uTestMarkers
/**
* Check marker functionality
*/
bool uTestMarkers()
{
AGraph graph( true);
ANode *dummy = graph.newNode();
graph.deleteNode( dummy);
ANode *pred = graph.newNode();
ANode *succ = graph.newNode();
AEdge *edge = graph.newEdge( pred, succ);
Marker m = graph.newMarker();
Marker m2 = graph.newMarker();
Marker m_array[ MAX_GRAPH_MARKERS];
assert( !pred->isMarked( m));
assert( !succ->isMarked( m));
assert( !edge->isMarked( m));
assert( !pred->isMarked( m2));
pred->mark( m);
succ->mark( m);
edge->mark( m);
edge->mark( m2);
assert( pred->isMarked( m));
assert( succ->isMarked( m));
assert( edge->isMarked( m));
assert( edge->isMarked( m2));
edge->unmark( m);
/** Check that different markers have different behaviour */
assert( edge->isMarked( m2));
assert( !edge->isMarked( m));
graph.freeMarker( m);
graph.freeMarker( m2);
for ( MarkerIndex i = 0; i < MAX_GRAPH_MARKERS; i++)
{
m_array [ i] = graph.newMarker();
}
for ( MarkerIndex i = 0; i < MAX_GRAPH_MARKERS; i++)
{
graph.freeMarker( m_array[ i]);
}
m = graph.newMarker();
graph.freeMarker( m);
ANode *n;
for ( n = graph.firstNode(); isNotNullP( n);)
{
ANode *tmp = n;
n = n->nextNode();
graph.deleteNode( tmp);
}
return true;
}