PhoenixGraph  01.0.0
Set of tools to simplify graph manipulation
Loading...
Searching...
No Matches
PNTreeLightNode.cpp File Reference
#include "PNTreeLightNode.h"
+ Include dependency graph for PNTreeLightNode.cpp:

Go to the source code of this file.

Functions

bool isNeighbourSearchFinised (const bool *tabIsNeighbourChecked, unsigned int nbNeighbour)
 Says is the neighbours search is finised.
 

Function Documentation

◆ isNeighbourSearchFinised()

bool isNeighbourSearchFinised ( const bool * tabIsNeighbourChecked,
unsigned int nbNeighbour )

Says is the neighbours search is finised.

Parameters
tabIsNeighbourChecked: tab of the neighbours search status (true if checked, false if not)
nbNeighbour: number of neighbours in the table
Returns
true if all the tabIsNeighbourChecked is true, false otherwise

Definition at line 15 of file PNTreeLightNode.cpp.

15 {
16 bool b(true);
17 for(unsigned int i(0u); i < nbNeighbour; ++i){
18 b &= tabIsNeighbourChecked[i];
19 }
20 return b;
21}

Referenced by PNTreeLightNode< T, U, N >::getCloserData().

+ Here is the caller graph for this function: