KokkosGraph::graph_color_distance2
##################################

Defined in header: :code:`KokkosGraph_Distance2Color.hpp`

.. code:: c++

  template <class KernelHandle, typename InRowmap, typename InEntries>
  void graph_color_distance2(KernelHandle *handle, typename KernelHandle::nnz_lno_t num_verts, InRowmap row_map,
                             InEntries row_entries);

Colors the vertices of a graph such that every vertex, its neighbors and its neighbors' neighbors have distict colors.

The graph must be symmetric, but it is not required to have diagonal entries. The coloring will not have distance-1 or distance-2 conflicts.

A view of length num_vertices, containing the colors will be returned through the handle: `handle->get_distance2_graph_coloring_handle()->get_vertex_colors()`

Parameters
==========

:handle: an instance of ``KokkosKernels::KokkosKernelsHandle`` that stores algorithm parameters and the output colors.

:num_verts: the number of vertices in the graph.

:row_map: the graph row map.

:row_entries: the graph column indices.

Type Requirements
=================

No type requirements will be asserted.

..
   .. note::

      Obviously we should probably look at improving this "No requirement asserted"...

Example
=======

.. literalinclude:: ../../../../example/wiki/graph/KokkosGraph_wiki_coloring.cpp
  :language: c++
  :lines: 16-