Nektar::MultiRegions::BottomUpSubStructuredGraph Class Reference

#include <SubStructuredGraph.h>

Public Member Functions
	BottomUpSubStructuredGraph (MultiLevelBisectedGraphSharedPtr graph, int nPartition=0, bool globaloffset=false)
	BottomUpSubStructuredGraph (const int nVerts)
	~BottomUpSubStructuredGraph (void)
int	GetTotDofs () const
void	UpdateBottomUpReordering (Array< OneD, int > &perm, Array< OneD, int > &iperm) const
void	ExpandGraphWithVertexWeights (const Array< OneD, const int > &wgts)
void	MaskPatches (const int leveltomask, Array< OneD, NekDouble > &maskarray) const
int	GetNpatchesWithInterior (const int whichlevel) const
void	GetNintDofsPerPatch (const int whichlevel, Array< OneD, unsigned int > &outarray) const
int	GetInteriorOffset (const int whichlevel, const int patch=0) const
std::vector< SubGraphSharedPtr >	GetInteriorBlocks (const int whichlevel) const
int	GetNumGlobalDofs (const int whichlevel) const
int	GetNlevels () const
void	Dump () const

Protected Attributes
std::vector< SubGraphSharedPtr >	m_IntBlocks
BottomUpSubStructuredGraphSharedPtr	m_daughterGraph

Private Member Functions
void	SetBottomUpReordering (Array< OneD, int > &iperm) const
BottomUpSubStructuredGraphSharedPtr	GetDaughterGraph () const
std::vector< SubGraphSharedPtr >	GetInteriorBlocks () const

Detailed Description

Definition at line 188 of file SubStructuredGraph.h.

Constructor & Destructor Documentation

BottomUpSubStructuredGraph() [1/2]

Nektar::MultiRegions::BottomUpSubStructuredGraph::BottomUpSubStructuredGraph	(	MultiLevelBisectedGraphSharedPtr	graph,
		int	nPartition = 0,
		bool	globaloffset = false
	)

Definition at line 305 of file SubStructuredGraph.cpp.

    : m_IntBlocks(), m_daughterGraph()
{
    int ncuts;
 
    if (nPartition > 0)
    {
        graph = MemoryManager<MultiLevelBisectedGraph>::AllocateSharedPtr(
            graph, nPartition);
    }
 
    if (globaloffset)
    {
        graph->SetGlobalNumberingOffset();
    }
 
    graph->CutEmptyLeaves();
    graph->CollectLeaves(m_IntBlocks);
    ncuts = graph->CutLeaves();
 
    if (ncuts)
    {
        m_daughterGraph =
            MemoryManager<BottomUpSubStructuredGraph>::AllocateSharedPtr(graph);
    }
}

References Nektar::MemoryManager< DataType >::AllocateSharedPtr(), m_daughterGraph, and m_IntBlocks.

BottomUpSubStructuredGraph() [2/2]

Nektar::MultiRegions::BottomUpSubStructuredGraph::BottomUpSubStructuredGraph

(

const int

nVerts

)

Definition at line 290 of file SubStructuredGraph.cpp.

    : m_IntBlocks(), m_daughterGraph()
{
    // This constructor should only be used in the very special case
    // when there is a graph consisting of nVerts vertices but without
    // any connectivity whatsowever (i.e. no edges)
 
    SubGraphSharedPtr subgraph;
    for (int i = 0; i < nVerts; i++)
    {
        subgraph = MemoryManager<SubGraph>::AllocateSharedPtr(1, i);
        m_IntBlocks.push_back(subgraph);
    }
}

References Nektar::MemoryManager< DataType >::AllocateSharedPtr(), and m_IntBlocks.

~BottomUpSubStructuredGraph()

Nektar::MultiRegions::BottomUpSubStructuredGraph::~BottomUpSubStructuredGraph

(

void

)

Definition at line 333 of file SubStructuredGraph.cpp.

{
}

Member Function Documentation

Dump()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::Dump

(

)

const

Definition at line 366 of file SubStructuredGraph.cpp.

{
    static int level = 0;
    level++;
 
    cout << "LEVEL " << level << endl;
    cout << "interior blocks" << endl;
    for (int i = 0; i < m_IntBlocks.size(); i++)
    {
        cout << "  " << i << "/" << m_IntBlocks.size() - 1 << ": "
             << m_IntBlocks[i]->GetNverts() << ", "
             << m_IntBlocks[i]->GetIdOffset() << endl;
    }
    cout << endl;
 
    if (m_daughterGraph.get())
    {
        m_daughterGraph->Dump();
    }
 
    level--;
}

References CellMLToNektar.pycml::level, m_daughterGraph, and m_IntBlocks.

ExpandGraphWithVertexWeights()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::ExpandGraphWithVertexWeights

(

const Array< OneD, const int > &

wgts

)

Definition at line 442 of file SubStructuredGraph.cpp.

{
    static int offset = 0;
    static int level  = 0;
    level++;
 
    if (m_daughterGraph.get())
    {
        m_daughterGraph->ExpandGraphWithVertexWeights(wgts);
    }
 
    for (int i = 0; i < m_IntBlocks.size(); i++)
    {
        int OrigGlobIdOffset = m_IntBlocks[i]->GetIdOffset();
        int newNverts        = 0;
 
        m_IntBlocks[i]->SetIdOffset(offset);
 
        for (int j = 0; j < m_IntBlocks[i]->GetNverts(); j++)
        {
            newNverts += wgts[OrigGlobIdOffset + j];
            offset += wgts[OrigGlobIdOffset + j];
        }
 
        m_IntBlocks[i]->SetNverts(newNverts);
    }
 
    // erase the blocks that do not have any vertices
    m_IntBlocks.erase(
        remove_if(m_IntBlocks.begin(), m_IntBlocks.end(), SubGraphWithoutVerts),
        m_IntBlocks.end());
 
    // remove the current level if there are no interior blocks
    if (m_IntBlocks.size() == 0 && m_daughterGraph.get())
    {
        m_IntBlocks     = m_daughterGraph->GetInteriorBlocks();
        m_daughterGraph = m_daughterGraph->GetDaughterGraph();
    }
 
    level--;
    if (level == 0)
    {
        offset = 0;
    }
}

References CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and Nektar::MultiRegions::SubGraphWithoutVerts().

GetDaughterGraph()

BottomUpSubStructuredGraphSharedPtr Nektar::MultiRegions::BottomUpSubStructuredGraph::GetDaughterGraph ( ) const

inlineprivate

Definition at line 233 of file SubStructuredGraph.h.

    {
        return m_daughterGraph;
    }

References m_daughterGraph.

GetInteriorBlocks() [1/2]

std::vector< SubGraphSharedPtr > Nektar::MultiRegions::BottomUpSubStructuredGraph::GetInteriorBlocks ( ) const

inlineprivate

Definition at line 237 of file SubStructuredGraph.h.

    {
        return m_IntBlocks;
    }

References m_IntBlocks.

GetInteriorBlocks() [2/2]

std::vector< SubGraphSharedPtr > Nektar::MultiRegions::BottomUpSubStructuredGraph::GetInteriorBlocks

(

const int

whichlevel

)

const

Definition at line 599 of file SubStructuredGraph.cpp.

{
    std::vector<SubGraphSharedPtr> returnval;
    static int level = 0;
    level++;
 
    if (level < whichlevel)
    {
        returnval = m_daughterGraph->GetInteriorBlocks(whichlevel);
    }
    else if (level == whichlevel)
    {
        returnval = m_IntBlocks;
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
    return returnval;
}

References Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

GetInteriorOffset()

int Nektar::MultiRegions::BottomUpSubStructuredGraph::GetInteriorOffset	(	const int	whichlevel,
		const int	patch = 0
	)		const

Definition at line 574 of file SubStructuredGraph.cpp.

{
    int retval       = -1;
    static int level = 0;
    level++;
 
    if (level < whichlevel)
    {
        retval = m_daughterGraph->GetInteriorOffset(whichlevel, patch);
    }
    else if (level == whichlevel)
    {
        retval = m_IntBlocks[patch]->GetIdOffset();
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
 
    return retval;
}

References Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

GetNintDofsPerPatch()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::GetNintDofsPerPatch	(	const int	whichlevel,
		Array< OneD, unsigned int > &	outarray
	)		const

Definition at line 546 of file SubStructuredGraph.cpp.

{
    static int level = 0;
    level++;
 
    if (level < whichlevel)
    {
        m_daughterGraph->GetNintDofsPerPatch(whichlevel, outarray);
    }
    else if (level == whichlevel)
    {
        ASSERTL1(outarray.size() >= m_IntBlocks.size(),
                 "Array dimension not sufficient");
 
        for (int i = 0; i < m_IntBlocks.size(); i++)
        {
            outarray[i] = (unsigned int)m_IntBlocks[i]->GetNverts();
        }
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
}

References ASSERTL1, Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

GetNlevels()

int Nektar::MultiRegions::BottomUpSubStructuredGraph::GetNlevels

(

)

const

Definition at line 648 of file SubStructuredGraph.cpp.

{
    int returnval    = 0;
    static int level = 0;
    level++;
 
    if (m_daughterGraph.get())
    {
        returnval = m_daughterGraph->GetNlevels();
    }
    returnval = max(returnval, level);
 
    level--;
 
    return returnval;
}

References CellMLToNektar.pycml::level, and m_daughterGraph.

GetNpatchesWithInterior()

int Nektar::MultiRegions::BottomUpSubStructuredGraph::GetNpatchesWithInterior

(

const int

whichlevel

)

const

Definition at line 521 of file SubStructuredGraph.cpp.

{
    int returnval    = -1;
    static int level = 0;
    level++;
 
    if (level < whichlevel)
    {
        returnval = m_daughterGraph->GetNpatchesWithInterior(whichlevel);
    }
    else if (level == whichlevel)
    {
        returnval = m_IntBlocks.size();
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
 
    return returnval;
}

References Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

GetNumGlobalDofs()

int Nektar::MultiRegions::BottomUpSubStructuredGraph::GetNumGlobalDofs

(

const int

whichlevel

)

const

Definition at line 623 of file SubStructuredGraph.cpp.

{
    int returnval    = -1;
    static int level = 0;
    level++;
 
    if (level < whichlevel)
    {
        returnval = m_daughterGraph->GetNumGlobalDofs(whichlevel);
    }
    else if (level == whichlevel)
    {
        returnval = m_IntBlocks[m_IntBlocks.size() - 1]->GetIdOffset() +
                    m_IntBlocks[m_IntBlocks.size() - 1]->GetNverts();
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
 
    return returnval;
}

References Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

GetTotDofs()

int Nektar::MultiRegions::BottomUpSubStructuredGraph::GetTotDofs

(

)

const

Definition at line 337 of file SubStructuredGraph.cpp.

{
    static int nIntDofs = 0;
    static int level    = 0;
    level++;
 
    int returnval;
 
    if (m_daughterGraph.get())
    {
        m_daughterGraph->GetTotDofs();
    }
 
    for (int i = 0; i < m_IntBlocks.size(); i++)
    {
        nIntDofs += m_IntBlocks[i]->GetNverts();
    }
 
    returnval = nIntDofs;
 
    level--;
    if (level == 0)
    {
        nIntDofs = 0;
    }
 
    return returnval;
}

References CellMLToNektar.pycml::level, m_daughterGraph, and m_IntBlocks.

Referenced by UpdateBottomUpReordering().

MaskPatches()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::MaskPatches	(	const int	leveltomask,
		Array< OneD, NekDouble > &	maskarray
	)		const

Definition at line 489 of file SubStructuredGraph.cpp.

{
    static int level = 0;
    level++;
 
    if (level < leveltomask)
    {
        m_daughterGraph->MaskPatches(leveltomask, maskarray);
    }
    else if (level == leveltomask)
    {
        int GlobIdOffset;
        int nVerts;
        for (int i = 0; i < m_IntBlocks.size(); i++)
        {
            GlobIdOffset = m_IntBlocks[i]->GetIdOffset();
            nVerts       = m_IntBlocks[i]->GetNverts();
            for (int j = 0; j < nVerts; j++)
            {
                maskarray[GlobIdOffset + j] = (NekDouble)i;
            }
        }
    }
    else
    {
        NEKERROR(ErrorUtil::efatal, "If statement should not arrive here");
    }
 
    level--;
}

References Nektar::ErrorUtil::efatal, CellMLToNektar.pycml::level, m_daughterGraph, m_IntBlocks, and NEKERROR.

SetBottomUpReordering()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::SetBottomUpReordering ( Array< OneD, int > &  iperm ) const

private

Definition at line 412 of file SubStructuredGraph.cpp.

{
    static int offset = 0;
    static int level  = 0;
    level++;
 
    if (m_daughterGraph.get())
    {
        m_daughterGraph->SetBottomUpReordering(iperm);
    }
 
    for (int i = 0; i < m_IntBlocks.size(); i++)
    {
        int GlobIdOffset = m_IntBlocks[i]->GetIdOffset();
        m_IntBlocks[i]->SetIdOffset(offset);
        for (int j = 0; j < m_IntBlocks[i]->GetNverts(); j++)
        {
            iperm[GlobIdOffset + j] = offset;
            offset++;
        }
    }
 
    level--;
    if (level == 0)
    {
        offset = 0;
    }
}

References CellMLToNektar.pycml::level, m_daughterGraph, and m_IntBlocks.

Referenced by UpdateBottomUpReordering().

UpdateBottomUpReordering()

void Nektar::MultiRegions::BottomUpSubStructuredGraph::UpdateBottomUpReordering	(	Array< OneD, int > &	perm,
		Array< OneD, int > &	iperm
	)		const

Definition at line 389 of file SubStructuredGraph.cpp.

{
    int nDofs = GetTotDofs();
 
    // Step 1: make a permutation array that goes from the current
    // reordering in the bottom-up graph to an ordering where the
    // interior dofs of the first (=bottom) level are ordered last,
    // followed interior dofs of the second level, ...
    Array<OneD, int> iperm1(nDofs);
    SetBottomUpReordering(iperm1);
 
    // Now, based upon the input permutation array, update the
    // permutation arrays between the original ordering of the dofs
    // (defined somewhere outside) and the final reordering as given by
    // iperm1
    for (int i = 0; i < nDofs; i++)
    {
        iperm[i]       = iperm1[iperm[i]];
        perm[iperm[i]] = i;
    }
}

References GetTotDofs(), and SetBottomUpReordering().

Member Data Documentation

m_daughterGraph

BottomUpSubStructuredGraphSharedPtr Nektar::MultiRegions::BottomUpSubStructuredGraph::m_daughterGraph

protected

Definition at line 228 of file SubStructuredGraph.h.

Referenced by BottomUpSubStructuredGraph(), Dump(), ExpandGraphWithVertexWeights(), GetDaughterGraph(), GetInteriorBlocks(), GetInteriorOffset(), GetNintDofsPerPatch(), GetNlevels(), GetNpatchesWithInterior(), GetNumGlobalDofs(), GetTotDofs(), MaskPatches(), and SetBottomUpReordering().

m_IntBlocks

std::vector<SubGraphSharedPtr> Nektar::MultiRegions::BottomUpSubStructuredGraph::m_IntBlocks

protected

Definition at line 227 of file SubStructuredGraph.h.

Referenced by BottomUpSubStructuredGraph(), Dump(), ExpandGraphWithVertexWeights(), GetInteriorBlocks(), GetInteriorOffset(), GetNintDofsPerPatch(), GetNpatchesWithInterior(), GetNumGlobalDofs(), GetTotDofs(), MaskPatches(), and SetBottomUpReordering().