Changeset 1367:a490662291b9 in lemon0.x for src/lemon/concept/graph_component.h
 Timestamp:
 04/18/05 16:59:24 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1812
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/lemon/concept/graph_component.h
r1359 r1367 305 305 /// If the graph does not contain node with the given id 306 306 /// then the result of the function is undetermined. 307 Node fromId(int id, Node) const { return INVALID;}307 Node fromId(int , Node) const { return INVALID;} 308 308 309 309 /// \brief Gives back an unique integer id for the Edge. … … 318 318 /// If the graph does not contain edge with the given id 319 319 /// then the result of the function is undetermined. 320 Edge fromId(int id, Edge) const { return INVALID;}320 Edge fromId(int, Edge) const { return INVALID;} 321 321 322 322 template <typename _Graph> … … 399 399 /// Adds a new Edge connects the two Nodes to the graph. 400 400 /// 401 Edge addEdge(const Node& from, const Node& to) {401 Edge addEdge(const Node&, const Node&) { 402 402 return INVALID; 403 403 } … … 746 746 /// 747 747 /// Copy Constructor. 748 GraphMap(const GraphMap& ) {}748 GraphMap(const GraphMap& gm) :ReadWriteMap<Item, _Value>(gm) {} 749 749 750 750 /// \brief Assign operator. … … 810 810 /// 811 811 /// Copy Constructor. 812 NodeMap(const NodeMap& ) {}812 NodeMap(const NodeMap& nm) : GraphMap<Graph, Node, _Value>(nm) {} 813 813 814 814 /// \brief Assign operator. … … 840 840 /// 841 841 /// Copy Constructor. 842 EdgeMap(const EdgeMap& ) {}842 EdgeMap(const EdgeMap& em) :GraphMap<Graph, Edge, _Value>(em) {} 843 843 844 844 /// \brief Assign operator. … … 918 918 /// 919 919 /// Add an edge to the graph and notify the observers. 920 Edge addEdge(const Node& from, const Node& to) {920 Edge addEdge(const Node&, const Node&) { 921 921 return INVALID; 922 922 }
Note: See TracChangeset
for help on using the changeset viewer.