/* ADH_Graph_Lib.h  (C) 2007  adolfo@di-mare.com  */

/** \file  ADH_Graph_Lib.h
    \brief Funciones de apoyo para \c ADH_Graph.h

    \author Adolfo Di Mare <adolfo@di-mare.com>
    \date   2007
*/

#ifndef ADH_Graph_Lib_h
#define ADH_Graph_Lib_h

#include "ADH_Graph.h"

namespace ADH {

std::ostream& operator<< (std::ostream &COUT, const Graph& G);
void dump( std::ostream & COUT, const Graph& G );

bool connected(
    const Graph & G ,             // grafo a examinar
    const std::string & src ,     // vértice de salida
    const std::string & dst ,     // vértice de llegada
    std::list< std::string > & C  // camino src->dst
);
bool isConnected( const Graph & G );
bool isCircuit( const Graph & G , std::list< std::string > &C );
bool isTree( const Graph& G );
bool spanningTree( const Graph & G , Graph & T );

} // namespace ADH

#endif // ADH_Graph_Lib_h

// EOF: ADH_Graph_Lib.h