Changeset 932:ade3cdb9b45d in lemon0.x for src/lemon
 Timestamp:
 10/01/04 12:08:43 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1255
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/lemon/graph_wrapper.h
r930 r932 431 431 TightEdgeFilter tight_edge_filter(g, dijkstra.distMap(), length); 432 432 433 ConstMap<Node, bool> const_true_map(true); 434 typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW; 435 SubGW gw(g, const_true_map, tight_edge_filter); 433 typedef EdgeSubGraphWrapper<Graph, TightEdgeFilter> SubGW; 434 SubGW gw(g, tight_edge_filter); 436 435 \endcode 437 436 Then, the maximum nimber of edgedisjoint \c s\c t paths are computed … … 672 671 673 672 673 /*! \brief A wrapper for hiding edges from a graph. 674 675 \warning Graph wrappers are in even more experimental state than the other 676 parts of the lib. Use them at you own risk. 677 678 A wrapper for hiding edges from a graph. 679 This wrapper specializes SubGraphWrapper in the way that only the edgeset 680 can be filtered. 681 \author Marton Makai 682 */ 683 template<typename Graph, typename EdgeFilterMap> 684 class EdgeSubGraphWrapper : 685 public SubGraphWrapper<Graph, ConstMap<typename Graph::Node,bool>, 686 EdgeFilterMap> { 687 public: 688 typedef SubGraphWrapper<Graph, ConstMap<typename Graph::Node,bool>, 689 EdgeFilterMap> Parent; 690 protected: 691 ConstMap<typename Graph::Node, bool> const_true_map; 692 public: 693 EdgeSubGraphWrapper(Graph& _graph, EdgeFilterMap& _edge_filter_map) : 694 Parent(), const_true_map(true) { 695 Parent::setGraph(_graph); 696 Parent::setNodeFilterMap(const_true_map); 697 Parent::setEdgeFilterMap(_edge_filter_map); 698 } 699 }; 700 674 701 675 702 template<typename Graph>
Note: See TracChangeset
for help on using the changeset viewer.