mirror of
https://github.com/boostorg/graph.git
synced 2025-05-09 23:14:00 +00:00
99 lines
3.4 KiB
C++
99 lines
3.4 KiB
C++
//=======================================================================
|
|
// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, Indiana University,
|
|
// Bloomington, IN 47405.
|
|
//
|
|
// Permission to modify the code and to distribute the code is
|
|
// granted, provided the text of this NOTICE is retained, a notice if
|
|
// the code was modified is included with the above COPYRIGHT NOTICE
|
|
// and with the COPYRIGHT NOTICE in the LICENSE file, and that the
|
|
// LICENSE file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
#include <boost/config.hpp>
|
|
#include <fstream>
|
|
#include <iostream>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/graph_utility.hpp>
|
|
|
|
using namespace boost;
|
|
|
|
namespace std
|
|
{
|
|
template < typename T >
|
|
std::istream & operator >> (std::istream & in, std::pair < T, T > &p)
|
|
{
|
|
in >> p.first >> p.second;
|
|
return in;
|
|
}
|
|
}
|
|
|
|
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
|
|
vecS, // Store vertex set in a std::vector
|
|
directedS // The file dependency graph is directed
|
|
> file_dep_graph;
|
|
|
|
typedef graph_traits < file_dep_graph >::vertex_descriptor vertex_t;
|
|
typedef graph_traits < file_dep_graph >::edge_descriptor edge_t;
|
|
|
|
bool
|
|
has_cycle_dfs(const file_dep_graph & g, vertex_t u,
|
|
default_color_type * color)
|
|
{
|
|
color[u] = gray_color;
|
|
graph_traits < file_dep_graph >::adjacency_iterator vi, vi_end;
|
|
for (tie(vi, vi_end) = adjacent_vertices(u, g); vi != vi_end; ++vi)
|
|
if (color[*vi] == white_color)
|
|
if (has_cycle_dfs(g, *vi, color))
|
|
return true; // cycle detected, return immediately
|
|
else if (color[*vi] == gray_color) // *vi is an ancestor!
|
|
return true;
|
|
color[u] = black_color;
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
has_cycle(const file_dep_graph & g)
|
|
{
|
|
std::vector < default_color_type > color(num_vertices(g), white_color);
|
|
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
|
|
for (tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
|
|
if (color[*vi] == white_color)
|
|
if (has_cycle_dfs(g, *vi, &color[0]))
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
|
|
int
|
|
main()
|
|
{
|
|
std::ifstream file_in("makefile-dependencies.dat");
|
|
typedef graph_traits < file_dep_graph >::vertices_size_type size_type;
|
|
size_type n_vertices;
|
|
file_in >> n_vertices; // read in number of vertices
|
|
std::istream_iterator < std::pair < size_type,
|
|
size_type > >input_begin(file_in), input_end;
|
|
file_dep_graph g(input_begin, input_end, n_vertices);
|
|
|
|
std::vector < std::string > name(num_vertices(g));
|
|
std::ifstream name_in("makefile-target-names.dat");
|
|
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
|
|
for (tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
|
|
name_in >> name[*vi];
|
|
|
|
assert(has_cycle(g) == false);
|
|
return 0;
|
|
}
|