mirror of
https://github.com/boostorg/graph.git
synced 2026-01-19 16:22:14 +00:00
86 lines
2.5 KiB
C++
86 lines
2.5 KiB
C++
//=======================================================================
|
|
// Copyright 2001 University of Notre Dame.
|
|
// Author: Jeremy G. Siek
|
|
//
|
|
// 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, University of Notre Dame, Notre
|
|
// Dame, IN 46556.
|
|
//
|
|
// Permission to modify the code and to distribute modified code is
|
|
// granted, provided the text of this NOTICE is retained, a notice that
|
|
// 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.
|
|
//=======================================================================
|
|
|
|
/*
|
|
Sample output:
|
|
|
|
filtered edge set: (A,B) (C,D) (D,B)
|
|
filtered out-edges:
|
|
A --> B
|
|
B -->
|
|
C --> D
|
|
D --> B
|
|
E -->
|
|
*/
|
|
|
|
#include <boost/config.hpp>
|
|
#include <iostream>
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
#include <boost/graph/filtered_graph.hpp>
|
|
#include <boost/graph/graph_utility.hpp>
|
|
|
|
template <typename EdgeWeightMap>
|
|
struct positive_edge_weight {
|
|
positive_edge_weight() { }
|
|
positive_edge_weight(EdgeWeightMap weight) : m_weight(weight) { }
|
|
template <typename Edge>
|
|
bool operator()(const Edge& e) const {
|
|
return 0 < boost::get(m_weight, e);
|
|
}
|
|
EdgeWeightMap m_weight;
|
|
};
|
|
|
|
|
|
int main()
|
|
{
|
|
using namespace boost;
|
|
|
|
typedef adjacency_list<vecS, vecS, directedS,
|
|
no_property, property<edge_weight_t, int> > Graph;
|
|
typedef property_map<Graph, edge_weight_t>::type EdgeWeightMap;
|
|
|
|
enum { A, B, C, D, E, N };
|
|
const char* name = "ABCDE";
|
|
Graph g(N);
|
|
add_edge(A, B, 2, g);
|
|
add_edge(A, C, 0, g);
|
|
add_edge(C, D, 1, g);
|
|
add_edge(C, E, 0, g);
|
|
add_edge(D, B, 3, g);
|
|
add_edge(E, C, 0, g);
|
|
|
|
positive_edge_weight<EdgeWeightMap> filter(get(edge_weight, g));
|
|
filtered_graph<Graph, positive_edge_weight<EdgeWeightMap> >
|
|
fg(g, filter);
|
|
|
|
std::cout << "filtered edge set: ";
|
|
print_edges(fg, name);
|
|
|
|
std::cout << "filtered out-edges:" << std::endl;
|
|
print_graph(fg, name);
|
|
|
|
return 0;
|
|
}
|