COIN-OR::LEMON - Graph Library

Changeset 959:c80ef5912903 in lemon-0.x for src/work/alpar


Ignore:
Timestamp:
11/04/04 21:24:59 (20 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1342
Message:

skeleton(s) -> concept renaming

Location:
src/work/alpar
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/work/alpar/dijkstra.h

    r955 r959  
    101101  ///This class provides an efficient implementation of %Dijkstra algorithm.
    102102  ///The edge lengths are passed to the algorithm using a
    103   ///\ref skeleton::ReadMap "ReadMap",
     103  ///\ref concept::ReadMap "ReadMap",
    104104  ///so it is easy to change it to any kind of length.
    105105  ///
    106106  ///The type of the length is determined by the
    107   ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
     107  ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
    108108  ///
    109109  ///It is also possible to change the underlying priority heap.
     
    118118  ///may involve in relatively time consuming process to compute the edge
    119119  ///length if it is necessary. The default map type is
    120   ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>".
     120  ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>".
    121121  ///The value of LM is not used directly by Dijkstra, it
    122122  ///is only passed to \ref DijkstraDefaultTraits.
  • src/work/alpar/list_graph_demo.cc

    r921 r959  
    11#include<list_graph.h>
    2 #include<skeletons/graph.h>
     2#include<concept/graph.h>
    33
    44#include <iostream>
Note: See TracChangeset for help on using the changeset viewer.