/* Copyright (c) 1997-2004
   Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany)
   http://www.math.tu-berlin.de/polymake,  mailto:polymake@math.tu-berlin.de

   This program is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by the
   Free Software Foundation; either version 2, or (at your option) any
   later version: http://www.gnu.org/licenses/gpl.txt.

   This program 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 General Public License for more details.
*/

#ifndef _POLYMAKE_GRAPH_BIPARTITE_H
#define _POLYMAKE_GRAPH_BIPARTITE_H "$Project: polymake $$Id: bipartite.h 5952 2005-04-07 15:04:36Z witte $"

namespace polymake { namespace graph {

/// Determine whether an undirected graph is bipartite.
   template <typename Graph>
   bool is_bipartite(const Graph& G);

/// Determine whether an undirected graph is bipartite.
/// Returns a negative int if not bipartite. If the graph is bipartite,
/// the absolute difference of the black and white colored nodes is returned.
   template <typename Graph>
   int is_bipartite_sign(const Graph& G);

} }

#include <bipartite.tcc>

#endif // _POLYMAKE_GRAPH_BIPARTITE_H

// Local Variables:
// mode:C++
// c-basic-offset:3
// End:
