COIN-OR::LEMON - Graph Library

Changeset 713:57c0b110b31e in lemon-0.x for src/hugo/list_graph.h


Ignore:
Timestamp:
07/20/04 12:58:11 (20 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@965
Message:

Oops: "static" and "const" does not like each other.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/list_graph.h

    r710 r713  
    138138    Node bNode(InEdgeIt e) const { return edges[e.n].tail; }
    139139
    140     static NodeIt& first(NodeIt& v) const {
     140    NodeIt& first(NodeIt& v) const {
    141141      v=NodeIt(*this); return v; }
    142     static EdgeIt& first(EdgeIt& e) const {
     142    EdgeIt& first(EdgeIt& e) const {
    143143      e=EdgeIt(*this); return e; }
    144     static OutEdgeIt& first(OutEdgeIt& e, const Node v) const {
     144    OutEdgeIt& first(OutEdgeIt& e, const Node v) const {
    145145      e=OutEdgeIt(*this,v); return e; }
    146     static InEdgeIt& first(InEdgeIt& e, const Node v) const {
     146    InEdgeIt& first(InEdgeIt& e, const Node v) const {
    147147      e=InEdgeIt(*this,v); return e; }
    148148
     
    153153//     It first(Node v) const { It e; first(e,v); return e; }
    154154
    155     static bool valid(Edge e) const { return e.n!=-1; }
    156     static bool valid(Node n) const { return n.n!=-1; }
     155    static bool valid(Edge e) { return e.n!=-1; }
     156    static bool valid(Node n) { return n.n!=-1; }
    157157   
    158158    static void setInvalid(Edge &e) { e.n=-1; }
    159159    static void setInvalid(Node &n) { n.n=-1; }
    160160   
    161     template <typename It> static It getNext(It it) const
     161    template <typename It> static It getNext(It it)
    162162    { It tmp(it); return next(tmp); }
    163163
     
    184184    }
    185185
    186     static int id(Node v) const { return v.n; }
    187     static int id(Edge e) const { return e.n; }
     186    static int id(Node v) { return v.n; }
     187    static int id(Edge e) { return e.n; }
    188188
    189189    /// Adds a new node to the graph.
     
    628628    ///Returns the oppositely directed
    629629    ///pair of the edge \c e.
    630     static Edge opposite(Edge e) const
     630    static Edge opposite(Edge e)
    631631    {
    632632      Edge f;
Note: See TracChangeset for help on using the changeset viewer.