Re: [Boost-bugs] [Boost C++ Libraries] #372: adjacency_matrix should model BidirectionalGraph

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #372: adjacency_matrix should model BidirectionalGraph
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2008-04-29 18:30:59

#372: adjacency_matrix should model BidirectionalGraph
-------------------------------+--------------------------------------------
  Reporter:  dgregor           |       Owner:  dgregor     
      Type:  Feature Requests  |      Status:  new         
 Milestone:                    |   Component:  graph       
   Version:  None              |    Severity:  Optimization
Resolution:  None              |    Keywords:              
-------------------------------+--------------------------------------------
Changes (by dgregor):

  * owner:  doug_gregor => dgregor

Old description:

> {{{
> Class template adjacency_matrix should model the
> BidirectionalGraph concept. This will require the introduction of an
> in_edge_iterator that strides across the rows of the adjacency
> matrix.
> }}}

New description:

 {{{
 Class template adjacency_matrix should model the
 BidirectionalGraph concept. This will require the introduction of an
 in_edge_iterator that strides across the rows of the adjacency
 matrix.
 }}}

-- 
Ticket URL: <http://svn.boost.org/trac/boost/ticket/372#comment:2>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.