3 #ifndef TPZCutHillMcKeeH 4 #define TPZCutHillMcKeeH 27 return fnodegraphindex[node+1]-fnodegraphindex[node];
44 return & ( fnodegraph[ fnodegraphindex[parent] ] );
67 std::queue<int64_t> &Q,
void Set2Vec(const std::set< int64_t > &myset, TPZVec< int64_t > &myVec) const
TPZManVector< int64_t > fnodegraph
void ShrinkLastLevel(TPZVec< int64_t > &LastLevel)
void GetAdjacentNodes(const TPZVec< int64_t > &parents, const TPZVec< int64_t > &exceptedNodes, TPZStack< int64_t > &adjNodes)
virtual void Resequence(TPZVec< int64_t > &permGather, TPZVec< int64_t > &permScatter, TPZVec< int64_t > &permGatherReverse, TPZVec< int64_t > &permScatterReverse)
virtual ~TPZCutHillMcKee()
Contains the TPZRenumbering class which defines the behavior to implementing node sequence numbering ...
void AdjacentNodes(int64_t parent, TPZVec< int64_t > &adjNodes)
int64_t Degree(int64_t node)
void RootedLevelStructure(int64_t rootNode, TPZStack< TPZStack< int64_t > > &LevelStructure)
This abstract class which defines the behavior which derived classes need to implement for implement...
int64_t SmallestDegree(TPZVec< int64_t > &ExploredNodes)
Free store vector implementation.
void AdjacentNodesOrdered(int64_t parent, const TPZVec< int64_t > &exceptedNodes, TPZVec< int64_t > &adjNodes)
TPZManVector< int64_t > fnodegraphindex
This class implements a stack object. Utility.
int64_t * AdjacentNodesPtr(int64_t parent, int64_t &n)
int64_t NElements() const
Returns the number of elements of the vector.
void SortNodes(TPZVec< int64_t > &nodes)
void PseudoPeripheralNodes(int64_t &startNode, int64_t &endNode)
void ProcessParentNode(int64_t Parent, SGraph &graph, TPZVec< int64_t > &ExploredNodes, TPZStack< int64_t > &R, std::queue< int64_t > &Q, TPZVec< int64_t > &adjNodes)
void