Changeset 1470:9b6f8c3587f0 in lemon-0.x for lemon
- Timestamp:
- 06/10/05 14:16:25 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1950
- Location:
- lemon
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/graph.h
r1448 r1470 212 212 /// Node -> NodeIt conversion. 213 213 214 /// Sets the iterator to the node of \c g pointed by the trivial215 /// iterator n.214 /// Sets the iterator to the node of \c the graph pointed by 215 /// the trivial iterator. 216 216 /// This feature necessitates that each time we 217 217 /// iterate the edge-set, the iteration order is the same. 218 NodeIt(const StaticGraph& g, const Node& n) { }218 NodeIt(const StaticGraph&, const Node&) { } 219 219 /// Next node. 220 220 … … 296 296 /// Edge -> OutEdgeIt conversion 297 297 298 /// Sets the iterator to the value of the trivial iterator \c e.299 298 /// Sets the iterator to the value of the trivial iterator. 299 /// This feature necessitates that each time we 300 300 /// iterate the edge-set, the iteration order is the same. 301 OutEdgeIt(const StaticGraph& g, const Edge& e) { }301 OutEdgeIt(const StaticGraph&, const Edge&) { } 302 302 ///Next outgoing edge 303 303 -
lemon/graph_to_eps.h
r1435 r1470 776 776 if(_scaleToA4) 777 777 if(bb.height()>bb.width()) { 778 double sc= min((A4HEIGHT-2*A4BORDER)/bb.height(),778 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(), 779 779 (A4WIDTH-2*A4BORDER)/bb.width()); 780 780 os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' ' … … 785 785 else { 786 786 //\todo Verify centering 787 double sc= min((A4HEIGHT-2*A4BORDER)/bb.width(),787 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(), 788 788 (A4WIDTH-2*A4BORDER)/bb.height()); 789 789 os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' ' -
lemon/graph_utils.h
r1467 r1470 679 679 return inverted.invMap[key]; 680 680 } 681 682 /// \brief Size of the map. 683 /// 684 /// Returns the size of the map. 685 unsigned size() const { 686 return inverted.invMap.size(); 687 } 681 688 682 689 private: -
lemon/list_graph.h
r1457 r1470 39 39 protected: 40 40 struct NodeT { 41 int first_in, first_out;41 int first_in, first_out; 42 42 int prev, next; 43 43 };
Note: See TracChangeset
for help on using the changeset viewer.