sloangraph.h

Go to the documentation of this file.

/*
 *
 *                 #####    #####   ######  ######  ###   ###
 *               ##   ##  ##   ##  ##      ##      ## ### ##
 *              ##   ##  ##   ##  ####    ####    ##  #  ##
 *             ##   ##  ##   ##  ##      ##      ##     ##
 *            ##   ##  ##   ##  ##      ##      ##     ##
 *            #####    #####   ##      ######  ##     ##
 *
 *
 *             OOFEM : Object Oriented Finite Element Code
 *
 *               Copyright (C) 1993 - 2025   Borek Patzak
 *
 *
 *
 *       Czech Technical University, Faculty of Civil Engineering,
 *   Department of Structural Mechanics, 166 29 Prague, Czech Republic
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2.1 of the License, or (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 */
 
#ifndef sloangraph_h
#define sloangraph_h
 
#include "oofemenv.h"
#include "sloangraphnode.h"
#include "sloanlevelstruct.h"
#include "dofmanager.h"
#include "intarray.h"
 
#include <list>
 
namespace oofem {
class TimeStep;
 
#define SLOAN_TIME_CHUNK 60
#define MDC
 
class Domain;

class OOFEM_EXPORT SloanGraph
{
public:
    enum SpineQualityType { Good, Best };
private:
    Domain *domain;

    std::vector< SloanGraphNode >nodes;
    std::vector< DofManager* >dmans;
    int numberOfNodes;
    int startNode;
    int endNode;
    std :: list< int >queue;
    int WeightDistance;
    int WeightDegree;
    SpineQualityType SpineQuality;
    int MinimalProfileSize;
    int OptimalWeightDegree;
    int OptimalWeightDistance;
    int nodeDistancesFlag;

    IntArray OptimalRenumberingTable;
 
public:
    SloanGraph(Domain * d);
    ~SloanGraph();

    Domain *giveDomain() { return this->domain; }
    void  initialize();
    void resetAll() { startNode = endNode = nodeDistancesFlag = 0; }

    SloanGraphNode &giveNode(int num);

    void findPeripheralNodes();
 
    int getNumberOfNodes() {return numberOfNodes;}
    int computeTrueDiameter();
    int findBestRoot();
    int giveFullProfileSize();
    int giveOptimalProfileSize() { return MinimalProfileSize; }
    double giveOptimalProfileDensity();

    int computeProfileSize();
    void askNewOptimalNumbering(TimeStep *tStep);
    IntArray &giveOptimalRenumberingTable() { return OptimalRenumberingTable; }
    void writeRenumberingTable(FILE *file);
    int writeOptimalRenumberingTable(FILE *file);

    void setWeightDistance(int w) {
        if ( w >= 0 ) {
            WeightDistance = w;
        }
    }

    void setWeightDegree(int w) {
        if ( w >= 0 ) {
            WeightDegree = w;
        }
    }

    void  setSpineQuality(SpineQualityType q) {
        SpineQuality = q;
        resetAll();
    }

    void printParameters();
    void setParameters(int wdeg, int wdis);
    void tryParameters(int wdeg, int wdis);
 
private:
    int giveNodeWithMinDegree();
    void extractCandidates(std :: list< int > &candidates, SloanLevelStructure &Spine);
    void initStatusAndPriority();
    void evaluateNodeDistances();
    void assignOldNumbers();
    void assignNewNumbers();
    void insertNeigborsOf(int);
    void modifyPriorityAround(int);
    int findTopPriorityInQueue();
#ifdef MDC
    void numberIsolatedNodes(int &NextNumber, int &labeledNodes);
#endif
};
 
class OOFEM_EXPORT SloanNodalDegreeOrderingCrit
{
    SloanGraph *graph;
public:
    SloanNodalDegreeOrderingCrit(SloanGraph * g) {
        graph = g;
    }
    int operator() (const int n1, const int n2) {
        return graph->giveNode(n1).giveDegree() - graph->giveNode(n2).giveDegree();
    }
};
} // end namespace oofem
#endif // sloangraph_h