예제 #1
0
void printListInt( List<int>* list)
{
    ListItem<int>* p = list->head();
    while (p != NULL)
    {
        out("%d", *(p->data()));
        p = p->next();
    }
}
예제 #2
0
파일: rank.cpp 프로젝트: MIPT-ILab/MIPT-Vis
/** 
 * Ordering nodes
 * Uses median/barycenter and transpose methods
 */
void AdjRank::doOrder( AdjRank* comp_rank)
{
	for( ListItem< NodeAux>* iter = adj_rank.head(); iter != NULL; iter = iter->next())
	{
		iter->data()->msetX( comp_rank->baryValue( iter->data())/* + iter->data()->width() / 2*/);
	}
	sortByVal();
	setInitX();
};