BGL: edge(u,v,g) complexity

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-09 00:11:45

www.boost.org/libs/graph/doc/AdjacencyMatrix.html doesn't require that
edge(u,v,g) is an O(1) operation. Shouldn't it?

===================================================
  David Abrahams, C++ library designer for hire
 resume: http://users.rcn.com/abrahams/resume.html

        C++ Booster (http://www.boost.org)
          email: david.abrahams_at_[hidden]
===================================================