COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changes in / [281:e9b4fbe163f5:279:6307bbbf285b] in lemon-1.0


Ignore:
Location:
lemon
Files:
15 edited

Legend:

Unmodified
Added
Removed

  • lemon/bfs.h

    r281 r278  
    5555    ///\param g is the digraph, to which we would like to define the
    5656    ///\ref PredMap.
     57    ///\todo The digraph alone may be insufficient to initialize
    5758    static PredMap *createPredMap(const Digraph &g)
    5859    {
    … …  
    6465    ///The type of the map that indicates which nodes are processed.
    6566    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
     67    ///By default it is a NullMap.
    6668    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    6769    ///Instantiates a \ref ProcessedMap.
    … …  
    195197    int _curr_dist;
    196198
    197     //Creates the maps if necessary.
     199    ///Creates the maps if necessary.
     200    ///\todo Better memory allocation (instead of new).
    198201    void create_maps()
    199202    {
    … …  
    846849    ///\param g is the digraph, to which we would like to define the
    847850    ///\ref PredMap.
     851    ///\todo The digraph alone may be insufficient to initialize
    848852    static PredMap *createPredMap(const Digraph &g)
    849853    {
    … …  
    13671371    int _list_front, _list_back;
    13681372
    1369     //Creates the maps if necessary.
     1373    ///Creates the maps if necessary.
     1374    ///\todo Better memory allocation (instead of new).
    13701375    void create_maps() {
    13711376      if(!_reached) {

  • lemon/bits/base_extender.h

    r280 r256  
    106106    /// Returns whether the given directed arc has the same orientation
    107107    /// as the corresponding edge.
     108    ///
     109    /// \todo reference to the corresponding point of the undirected digraph
     110    /// concept. "What does the direction of an edge mean?"
    108111    static bool direction(const Arc &a) { return a.forward; }
    109112

  • lemon/bits/vector_map.h

    r280 r263  
    4343  /// the map. This map type uses the std::vector to store the values.
    4444  ///
    45   /// \tparam _Graph The graph this map is attached to.
     45  /// \tparam _Notifier The AlterationNotifier that will notify this map.
    4646  /// \tparam _Item The item type of the graph items.
    4747  /// \tparam _Value The value type of the map.
     48  /// \todo Fix the doc: there is _Graph parameter instead of _Notifier.
    4849  template <typename _Graph, typename _Item, typename _Value>
    4950  class VectorMap

  • lemon/concept_check.h

    r280 r209  
    3737///\brief Basic utilities for concept checking.
    3838///
     39///\todo Are we still using BOOST concept checking utility?
     40///Is the BOOST copyright notice necessary?
    3941
    4042#ifndef LEMON_CONCEPT_CHECK_H

  • lemon/concepts/path.h

    r281 r278  
    2121///\brief Classes for representing paths in digraphs.
    2222///
     23///\todo Iterators have obsolete style
    2324
    2425#ifndef LEMON_CONCEPT_PATH_H

  • lemon/dfs.h

    r281 r278  
    5656    ///\param g is the digraph, to which we would like to define the
    5757    ///\ref PredMap.
     58    ///\todo The digraph alone may be insufficient to initialize
    5859    static PredMap *createPredMap(const Digraph &g)
    5960    {
    … …  
    6566    ///The type of the map that indicates which nodes are processed.
    6667    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
     68    ///By default it is a NullMap.
    6769    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    6870    ///Instantiates a \ref ProcessedMap.
    … …  
    195197    int _stack_head;
    196198
    197     //Creates the maps if necessary.
     199    ///Creates the maps if necessary.
     200    ///\todo Better memory allocation (instead of new).
    198201    void create_maps()
    199202    {
    … …  
    780783    ///\param g is the digraph, to which we would like to define the
    781784    ///\ref PredMap.
     785    ///\todo The digraph alone may be insufficient to initialize
    782786    static PredMap *createPredMap(const Digraph &g)
    783787    {
    … …  
    13141318    int _stack_head;
    13151319
    1316     //Creates the maps if necessary.
     1320    ///Creates the maps if necessary.
     1321    ///\todo Better memory allocation (instead of new).
    13171322    void create_maps() {
    13181323      if(!_reached) {

  • lemon/dijkstra.h

    r281 r278  
    145145    ///\param g is the digraph, to which we would like to define the
    146146    ///\ref PredMap.
     147    ///\todo The digraph alone may be insufficient for the initialization
    147148    static PredMap *createPredMap(const Digraph &g)
    148149    {
    … …  
    155156    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    156157    ///By default it is a NullMap.
     158    ///\todo If it is set to a real map,
     159    ///Dijkstra::processed() should read this.
    157160    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    158161    ///Instantiates a \ref ProcessedMap.
    … …  
    295298    bool local_heap;
    296299
    297     //Creates the maps if necessary.
     300    ///Creates the maps if necessary.
     301    ///\todo Better memory allocation (instead of new).
    298302    void create_maps()
    299303    {
    … …  
    955959    /// \param g is the digraph, to which we would like to define the
    956960    /// HeapCrossRef.
     961    /// \todo The digraph alone may be insufficient for the initialization
    957962    static HeapCrossRef *createHeapCrossRef(const Digraph &g)
    958963    {
    … …  
    990995    ///\param g is the digraph, to which we would like to define the
    991996    ///\ref PredMap.
     997    ///\todo The digraph alone may be insufficient to initialize
    992998    static PredMap *createPredMap(const Digraph &g)
    993999    {
    … …  
    10001006    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    10011007    ///By default it is a NullMap.
     1008    ///\todo If it is set to a real map,
     1009    ///Dijkstra::processed() should read this.
     1010    ///\todo named parameter to set this type, function to read and write.
    10021011    typedef NullMap<typename Digraph::Node,bool> ProcessedMap;
    10031012    ///Instantiates a \ref ProcessedMap.
    … …  
    10451054  /// The \ref DijkstraWizardBase is a class to be the default traits of the
    10461055  /// \ref DijkstraWizard class.
     1056  /// \todo More named parameters are required...
    10471057  template<class GR,class LM>
    10481058  class DijkstraWizardBase : public DijkstraWizardDefaultTraits<GR,LM>

  • lemon/error.h

    r280 r212  
    103103    ///\e
    104104
     105    ///\todo The good solution is boost::shared_ptr...
     106    ///
    105107    mutable std::auto_ptr<std::ostringstream> buf;
    106108

  • lemon/graph_to_eps.h

    r280 r253  
    667667  ///it draws the graph.
    668668  void run() {
     669    //\todo better 'epsilon' would be nice here.
    669670    const double EPSILON=1e-9;
    670671    if(dontPrint) return;
    … …  
    707708      for(ArcIt e(g);e!=INVALID;++e)
    708709        max_w=std::max(double(_arcWidths[e]),max_w);
     710      //\todo better 'epsilon' would be nice here.
    709711      if(max_w>EPSILON) {
    710712        _arcWidthScale/=max_w;
    … …  
    716718      for(NodeIt n(g);n!=INVALID;++n)
    717719        max_s=std::max(double(_nodeSizes[n]),max_s);
     720      //\todo better 'epsilon' would be nice here.
    718721      if(max_s>EPSILON) {
    719722        _nodeScale/=max_s;
    … …  
    871874      }
    872875      else {
     876        //\todo Verify centering
    873877        double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
    874878                  (A4WIDTH-2*A4BORDER)/bb.height());
    … …  
    903907            dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]);
    904908          double l=std::sqrt(dvec.normSquare());
     909          //\todo better 'epsilon' would be nice here.
    905910          dim2::Point<double> d(dvec/std::max(l,EPSILON));
    906911          dim2::Point<double> m;

  • lemon/list_graph.h

    r280 r239  
    502502    ///be invalidated.
    503503    ///
    504     ///\warning This functionality cannot be used in conjunction with the
     504    ///\warning This functionality cannot be used together with the
    505505    ///Snapshot feature.
     506    ///
     507    ///\todo It could be implemented in a bit faster way.
    506508    Node split(Node n, bool connect = true) {
    507509      Node b = addNode();

  • lemon/maps.h

    r280 r220  
    485485  ///
    486486  /// \sa CombineMap
     487  ///
     488  /// \todo Check the requirements.
    487489  template <typename M1, typename M2>
    488490  class ComposeMap : public MapBase<typename M2::Key, typename M1::Value> {
    … …  
    539541  ///
    540542  /// \sa ComposeMap
     543  ///
     544  /// \todo Check the requirements.
    541545  template<typename M1, typename M2, typename F,
    542546           typename V = typename F::result_type>

  • lemon/random.h

    r280 r209  
    822822    /// \note The Cartesian form of the Box-Muller
    823823    /// transformation is used to generate a random normal distribution.
     824    /// \todo Consider using the "ziggurat" method instead.
    824825    double gauss()
    825826    {

  • lemon/smart_graph.h

    r280 r238  
    301301    ///\warning This functionality cannot be used together with the Snapshot
    302302    ///feature.
     303    ///\todo It could be implemented in a bit faster way.
    303304    Node split(Node n, bool connect = true)
    304305    {

  • lemon/time_measure.h

    r280 r210  
    293293  ///function, consider the usage of \ref TimeReport instead.
    294294  ///
     295  ///\todo This shouldn't be Unix (Linux) specific.
    295296  ///\sa TimeReport
    296297  class Timer
    … …  
    487488  ///\sa Timer
    488489  ///\sa NoTimeReport
     490  ///\todo There is no test case for this
    489491  class TimeReport : public Timer
    490492  {

  • lemon/tolerance.h

    r280 r209  
    2525///floating point numbers.
    2626///
     27///\todo It should be in a module like "Basic tools"
     28
    2729
    2830namespace lemon {
Note: See TracChangeset for help on using the changeset viewer.