Changeset 910:5a89cacf17f1 in lemon-0.x for src/hugo/graph_wrapper.h
- Timestamp:
- 09/27/04 20:11:27 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1221
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/graph_wrapper.h
r906 r910 28 28 #include <hugo/invalid.h> 29 29 #include <hugo/maps.h> 30 #include <hugo/map_defines.h> 30 31 #include <iostream> 31 32 … … 315 316 /// This wrapper shows a graph with filtered node-set and 316 317 /// edge-set. Given a bool-valued map on the node-set and one on 317 /// the edge-set of the graphs, the iterators show sonly the objects318 /// the edge-set of the graphs, the iterators show only the objects 318 319 /// having true value. 319 320 /// The quick brown fox iterators jump over … … 578 579 }; 579 580 580 /// \brief An undirected graph template.581 ///582 ///\warning Graph wrappers are in even more experimental state than the other583 ///parts of the lib. Use them at your own risk.584 ///585 /// An undirected graph template.586 /// This class works as an undirected graph and a directed graph of587 /// class \c Graph is used for the physical storage.588 /// \ingroup graphs581 // /// \brief An undirected graph template. 582 // /// 583 // ///\warning Graph wrappers are in even more experimental state than the other 584 // ///parts of the lib. Use them at your own risk. 585 // /// 586 // /// An undirected graph template. 587 // /// This class works as an undirected graph and a directed graph of 588 // /// class \c Graph is used for the physical storage. 589 // /// \ingroup graphs 589 590 template<typename Graph> 590 591 class UndirGraph : public UndirGraphWrapper<Graph> { … … 609 610 /// 610 611 /// Suppose that for a directed graph $G=(V, A)$, 611 /// two predicates on the edge-set, $forward_filter$, and $backward_filter$ 612 /// two bool valued maps on the edge-set, 613 /// $forward_filter$, and $backward_filter$ 612 614 /// is given, and we are dealing with the directed graph 613 615 /// a $G'=(V, \{uv : uv\in A \mbox{ and } forward_filter(uv) \mbox{ is true}\}+\{vu : uv\in A \mbox{ and } backward_filter(uv) \mbox{ is true}\})$. … … 622 624 /// But BidirGraphWrapper is obtained from 623 625 /// SubBidirGraphWrapper by considering everywhere true 624 /// predicates bothforward_filter and backward_filter.626 /// valued maps both for forward_filter and backward_filter. 625 627 /// Finally, one of the most important applications of SubBidirGraphWrapper 626 628 /// is ResGraphWrapper, which stands for the residual graph in directed … … 629 631 /// above mentioned graph structure without its physical storage, 630 632 /// that is the whole stuff eats constant memory. 631 /// As the oppositely directed edges are logical different,633 /// As the oppositely directed edges are logically different, 632 634 /// the maps are able to attach different values for them. 633 635 template<typename Graph, … … 671 673 typedef typename Graph::Edge GraphEdge; 672 674 /// SubBidirGraphWrapper<..., ..., ...>::Edge is inherited from 673 /// Graph::Edge. It contains an extra bool flag which shows if the 675 /// Graph::Edge. It contains an extra bool flag which is true 676 /// if and only if the 674 677 /// edge is the backward version of the original edge. 675 678 class Edge : public Graph::Edge { … … 1131 1134 /// \brief Residual capacity map. 1132 1135 /// 1133 /// In generic residual graphs the residual capacity can be obtained as a map. Not tested. 1136 /// In generic residual graphs the residual capacity can be obtained 1137 /// as a map. 1134 1138 class ResCap { 1135 1139 protected:
Note: See TracChangeset
for help on using the changeset viewer.