model_part_graph_utilities.h

Go to the documentation of this file.

//    |  /           |
//    ' /   __| _` | __|  _ \   __|
//    . \  |   (   | |   (   |\__ `
//   _|\_\_|  \__,_|\__|\___/ ____/
//                   Multi-Physics
//
//  License:         BSD License
//                   Kratos default license: kratos/license.txt
//
//  Main authors:   Riccardo Rossi
//
 
#pragma once
 
// System includes
#include <string>
#include <iostream>
 
// External includes
 
 
// Project includes
#include "includes/define.h"
#include "includes/model_part.h"
#include "containers/sparse_contiguous_row_graph.h"
 
 
namespace Kratos
{
 
 
 
 
 
 
 
class KRATOS_API(KRATOS_CORE) ModelPartGraphUtilities
{
public:
    typedef unsigned int IndexType;
 
    KRATOS_CLASS_POINTER_DEFINITION(ModelPartGraphUtilities);
 
 
    ModelPartGraphUtilities() = delete;
 
    ModelPartGraphUtilities(ModelPartGraphUtilities const& rOther) = delete;
 
 
    ModelPartGraphUtilities& operator=(ModelPartGraphUtilities const& rOther) = delete;
 
 
    static Kratos::unique_ptr<SparseContiguousRowGraph<>> ComputeGraph(const ModelPart& rModelPart);
 
    static std::pair<DenseVector<IndexType>, DenseVector<IndexType>> ComputeCSRGraph(const ModelPart& rModelPart);
 
    static std::pair<IndexType, DenseVector<double>> ComputeConnectedComponents(
        const ModelPart::NodesContainerType& rNodes,
        const DenseVector<IndexType>& rRowIndices,
        const DenseVector<IndexType>& rColIndices
        );
 
    //similar to the previous version, except that a "active_nodes" array needs to be passed
    //the "active_nodes" array needs to be initialized without gaps in the same order in which the nodes are passed in the rNodes array
    static std::pair<IndexType, DenseVector<double>> ComputeConnectedComponentsWithActiveNodesCheck(
        const ModelPart::NodesContainerType& rNodes,
        const DenseVector<IndexType>& rRowIndices,
        const DenseVector<IndexType>& rColIndices,
        const std::vector<bool>& active_nodes_list
        );
 
    static std::vector<IndexType> ApplyMinimalScalarFixity(
        ModelPart::NodesContainerType& rNodes,
        const Variable<double>& rVar,
        const DenseVector<double>& colors,
        const IndexType ncolors
        );
 
 
 
 
 
 
 
 
 
protected:
 
 
 
 
 
 
    // BFS algorithm for computing connected components - simplest version - only considers connectivity
    static void BreadthFirstSearch(
        const int startVertex,
        const int color,
        const DenseVector<IndexType>& rRowIndices,
        const DenseVector<IndexType>& rColIndices,
        std::unordered_map<IndexType, int>& rVisited);
 
    // BFS algorithm for computing connected components
    // an edge is active only if both endpoints are marked as active in the "active_nodes" map
    static void BreadthFirstSearchWithActiveNodesCheck(
        const int startVertex,
        const int color,
        const DenseVector<IndexType>& rRowIndices,
        const DenseVector<IndexType>& rColIndices,
        std::unordered_map<IndexType, int>& rVisited,
        const std::unordered_map<IndexType, bool>& rActiveNodes);
 
 
 
 
 
 
 
 
private:
 
 
 
 
 
 
 
 
 
 
 
 
 
 
}; // Class ModelPartGraphUtilities
 
 
 
 
 
 
 
}  // namespace Kratos.