17 Mar
2009
17 Mar
'09
3:48 p.m.
On Tue, Mar 17, 2009 at 11:42 AM, Andrew Sutton
I would guess it's working for me by accident since I'm never removing anything from the graphs I create. I'll make sure to keep my usage to listS for now.
Be forewarned: num_edges()/num_vertices() with listS is O(n).
So what's the recommendation? The Known Bugs page says that anything other than listS is not guaranteed to work for EdgeList, but if std::list has O(n) size(), then num_edges()/num_vertices() becomes O(n)? Or were you talking about OutEdgeList? Are there *known* cases where vecS is bug-free when used for the EdgeList? In my case, I know the total number of edges ahead of time, and no edges or vertices will ever be removed. --Michael Fawcett