parameters: (graph, verbose=True)
return_statement: return GraphColoringModel(params["model"])
docstring: Compute the graph coloring. Assign a color to each vertex such that no
      adjacent vertices have the same color. Return a model object with total
      number of colors used as well as the color ID for each vertex in the graph.
      This algorithm is greedy and is not guaranteed to find the **minimum** graph
      coloring. It is also not deterministic, so successive runs may return
      different answers.
  
      Parameters
      ----------
      graph : SGraph
          The graph on which to compute the coloring.
  
      verbose : bool, optional
          If True, print progress updates.
  
      Returns
      -------
      out : GraphColoringModel
  
      References
      ----------
      - `Wikipedia - graph coloring <http://en.wikipedia.org/wiki/Graph_coloring>`_
  
      Examples
      --------
      If given an :class:`~turicreate.SGraph` ``g``, we can create
      a :class:`~turicreate.graph_coloring.GraphColoringModel` as follows:
  
      >>> g = turicreate.load_sgraph('http://snap.stanford.edu/data/email-Enron.txt.gz', format='snap')
      >>> gc = turicreate.graph_coloring.create(g)
  
      We can obtain the ``color id`` corresponding to each vertex in the graph ``g``
      as follows:
  
      >>> color_id = gc['color_id']  # SFrame
  
      We can obtain the total number of colors required to color the graph ``g``
      as follows:
  
      >>> num_colors = gc['num_colors']
  
      See Also
      --------
      GraphColoringModel
docstring_summary: Compute the graph coloring. Assign a color to each vertex such that no
      adjacent vertices have the same color. Return a model object with total
      number of colors used as well as the color ID for each vertex in the graph.
      This algorithm is greedy and is not guaranteed to find the **minimum** graph
      coloring. It is also not deterministic, so successive runs may return
      different answers.
docstring_tokens: Compute the graph coloring . Assign a color to each vertex such that no adjacent vertices have the same color . Return a model object with total number of colors used as well as the color ID for each vertex in the graph . This algorithm is greedy and is not guaranteed to find the ** minimum ** graph coloring . It is also not deterministic so successive runs may return different answers .
function: def create(graph, verbose=True):
      """
      Compute the graph coloring. Assign a color to each vertex such that no
      adjacent vertices have the same color. Return a model object with total
      number of colors used as well as the color ID for each vertex in the graph.
      This algorithm is greedy and is not guaranteed to find the **minimum** graph
      coloring. It is also not deterministic, so successive runs may return
      different answers.
  
      Parameters
      ----------
      graph : SGraph
          The graph on which to compute the coloring.
  
      verbose : bool, optional
          If True, print progress updates.
  
      Returns
      -------
      out : GraphColoringModel
  
      References
      ----------
      - `Wikipedia - graph coloring <http://en.wikipedia.org/wiki/Graph_coloring>`_
  
      Examples
      --------
      If given an :class:`~turicreate.SGraph` ``g``, we can create
      a :class:`~turicreate.graph_coloring.GraphColoringModel` as follows:
  
      >>> g = turicreate.load_sgraph('http://snap.stanford.edu/data/email-Enron.txt.gz', format='snap')
      >>> gc = turicreate.graph_coloring.create(g)
  
      We can obtain the ``color id`` corresponding to each vertex in the graph ``g``
      as follows:
  
      >>> color_id = gc['color_id']  # SFrame
  
      We can obtain the total number of colors required to color the graph ``g``
      as follows:
  
      >>> num_colors = gc['num_colors']
  
      See Also
      --------
      GraphColoringModel
      """
      from turicreate._cython.cy_server import QuietProgress
  
      if not isinstance(graph, _SGraph):
          raise TypeError("graph input must be a SGraph object.")
  
      with QuietProgress(verbose):
          params = _tc.extensions._toolkits.graph.graph_coloring.create(
              {"graph": graph.__proxy__}
          )
      return GraphColoringModel(params["model"])
function_tokens: def create ( graph , verbose = True ) : from turicreate . _cython . cy_server import QuietProgress if not isinstance ( graph , _SGraph ) : raise TypeError ( "graph input must be a SGraph object." ) with QuietProgress ( verbose ) : params = _tc . extensions . _toolkits . graph . graph_coloring . create ( { "graph" : graph . __proxy__ } ) return GraphColoringModel ( params [ "model" ] )