Loading...
Searching...
No Matches
GraphBuilder.h
// Copyright (C) 2010-2013 Garth N. Wells
//
// This file is part of DOLFIN.
//
// DOLFIN 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 3 of the License, or
// (at your option) any later version.
//
// DOLFIN 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 DOLFIN. If not, see <http://www.gnu.org/licenses/>.
//
// First added: 2010-02-19
// Last changed: 2013-01-16
#ifndef __GRAPH_BUILDER_H
#define __GRAPH_BUILDER_H
#include <cstdint>
#include <utility>
#include <set>
#include <boost/unordered_map.hpp>
#include <vector>
#include <boost/multi_array.hpp>
#include <dolfin/common/MPI.h>
#include "Graph.h"
namespace dolfin
{
// Forward declarations
class CellType;
class GenericDofMap;
class Mesh;
class GraphBuilder
{
public:
static Graph local_graph(const Mesh& mesh, const GenericDofMap& dofmap0,
const GenericDofMap& dofmap1);
static Graph local_graph(const Mesh& mesh,
const std::vector<std::size_t>& coloring_type);
static Graph local_graph(const Mesh& mesh, std::size_t dim0,
std::size_t dim1);
static
std::pair<std::int32_t, std::int32_t>
compute_dual_graph(const MPI_Comm mpi_comm,
const boost::multi_array<std::int64_t, 2>& cell_vertices,
const CellType& cell_type,
const std::int64_t num_global_vertices,
std::vector<std::vector<std::size_t>>& local_graph,
std::set<std::int64_t>& ghost_vertices);
private:
friend class MeshPartitioning;
typedef std::vector<std::pair<std::vector<std::size_t>, std::int32_t>>
FacetCellMap;
// Compute local part of the dual graph, and return number of
// local edges in the graph (undirected)
static std::int32_t
compute_local_dual_graph(const MPI_Comm mpi_comm,
const boost::multi_array<std::int64_t, 2>& cell_vertices,
const CellType& cell_type,
std::vector<std::vector<std::size_t>>& local_graph,
FacetCellMap& facet_cell_map);
// Compute local part of the dual graph, and return number of
// local edges in the graph (undirected)
template<int N>
static std::int32_t
compute_local_dual_graph_keyed(const MPI_Comm mpi_comm,
const boost::multi_array<std::int64_t, 2>& cell_vertices,
const CellType& cell_type,
std::vector<std::vector<std::size_t>>& local_graph,
FacetCellMap& facet_cell_map);
// Build nonlocal part of dual graph for mesh and return number of
// non-local edges. Note: GraphBuilder::compute_local_dual_graph
// should be called before this function is called.
static std::int32_t
compute_nonlocal_dual_graph(const MPI_Comm mpi_comm,
const boost::multi_array<std::int64_t, 2>& cell_vertices,
const CellType& cell_type,
const std::int64_t num_global_vertices,
std::vector<std::vector<std::size_t>>& local_graph,
FacetCellMap& facet_cell_map,
std::set<std::int64_t>& ghost_vertices);
};
}
#endif
dolfin::CellType
Definition CellType.h:47
dolfin::GenericDofMap
This class provides a generic interface for dof maps.
Definition GenericDofMap.h:50
dolfin::GraphBuilder
This class builds a Graph corresponding to various objects.
Definition GraphBuilder.h:44
dolfin::GraphBuilder::local_graph
static Graph local_graph(const Mesh &mesh, const GenericDofMap &dofmap0, const GenericDofMap &dofmap1)
Build local graph from dofmap.
Definition GraphBuilder.cpp:45
dolfin::GraphBuilder::compute_dual_graph
static std::pair< std::int32_t, std::int32_t > compute_dual_graph(const MPI_Comm mpi_comm, const boost::multi_array< std::int64_t, 2 > &cell_vertices, const CellType &cell_type, const std::int64_t num_global_vertices, std::vector< std::vector< std::size_t > > &local_graph, std::set< std::int64_t > &ghost_vertices)
Definition GraphBuilder.cpp:157
dolfin::Mesh
Definition Mesh.h:84
dolfin
Definition adapt.h:30
dolfin::Graph
std::vector< graph_set_type > Graph
Vector of unordered Sets.
Definition Graph.h:39