PolycrystalICTools.C File Reference

Go to the source code of this file.

Namespaces
namespace	GraphColoring
namespace	PolycrystalICTools

Functions
bool	colorGraph (const PolycrystalICTools::AdjacencyMatrix< Real > &adjacency_matrix, std::vector< unsigned int > &colors, unsigned int n_vertices, unsigned int n_colors, unsigned int vertex)
	Backtracking graph coloring routines.
bool	isGraphValid (const PolycrystalICTools::AdjacencyMatrix< Real > &adjacency_matrix, std::vector< unsigned int > &colors, unsigned int n_vertices, unsigned int vertex, unsigned int color)
void	visitElementalNeighbors (const Elem *elem, const MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries *pb, std::set< dof_id_type > &halo_ids)
	Utility routines.

Variables
const unsigned int	GraphColoring::INVALID_COLOR = std::numeric_limits<unsigned int>::max()
const unsigned int	PolycrystalICTools::HALO_THICKNESS = 4

Function Documentation

colorGraph()

bool colorGraph	(	const PolycrystalICTools::AdjacencyMatrix< Real > &	adjacency_matrix,
		std::vector< unsigned int > &	colors,
		unsigned int	n_vertices,
		unsigned int	n_ops,
		unsigned int	vertex
	)

Backtracking graph coloring routines.

Definition at line 400 of file PolycrystalICTools.C.

{
  // Base case: All grains are assigned
  if (vertex == n_vertices)
    return true;
 
  // Consider this grain and try different ops
  for (unsigned int color_idx = 0; color_idx < n_colors; ++color_idx)
  {
    // We'll try to spread these colors around a bit rather than
    // packing them all on the first few colors if we have several colors.
    unsigned int color = (vertex + color_idx) % n_colors;
 
    if (isGraphValid(adjacency_matrix, colors, n_vertices, vertex, color))
    {
      colors[vertex] = color;
 
      if (colorGraph(adjacency_matrix, colors, n_vertices, n_colors, vertex + 1))
        return true;
 
      // Backtrack...
      colors[vertex] = GraphColoring::INVALID_COLOR;
    }
  }
 
  return false;
}

Referenced by PolycrystalICTools::assignOpsToGrains(), and colorGraph().

isGraphValid()

bool isGraphValid	(	const PolycrystalICTools::AdjacencyMatrix< Real > &	adjacency_matrix,
		std::vector< unsigned int > &	colors,
		unsigned int	n_vertices,
		unsigned int	vertex,
		unsigned int	color
	)

Definition at line 433 of file PolycrystalICTools.C.

{
  // See if the proposed color is valid based on the current neighbor colors
  for (unsigned int neighbor = 0; neighbor < n_vertices; ++neighbor)
    if (adjacency_matrix(vertex, neighbor) && color == colors[neighbor])
      return false;
  return true;
}

Referenced by colorGraph().

visitElementalNeighbors()

void visitElementalNeighbors	(	const Elem *	elem,
		const MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb,
		std::set< dof_id_type > &	halo_ids
	)

Utility routines.

Definition at line 367 of file PolycrystalICTools.C.

{
  mooseAssert(elem, "Elem is NULL");
 
  std::vector<const Elem *> all_active_neighbors;
 
  // Loop over all neighbors (at the the same level as the current element)
  for (unsigned int i = 0; i < elem->n_neighbors(); ++i)
  {
    const Elem * neighbor_ancestor = elem->topological_neighbor(i, mesh, point_locator, pb);
    if (neighbor_ancestor)
      // Retrieve only the active neighbors for each side of this element, append them to the list
      // of active neighbors
      neighbor_ancestor->active_family_tree_by_topological_neighbor(
          all_active_neighbors, elem, mesh, point_locator, pb, false);
  }
 
  // Loop over all active element neighbors
  for (std::vector<const Elem *>::const_iterator neighbor_it = all_active_neighbors.begin();
       neighbor_it != all_active_neighbors.end();
       ++neighbor_it)
    if (*neighbor_it)
      halo_ids.insert((*neighbor_it)->id());
}