alpar@305: /* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@305: *
alpar@305: * This file is a part of LEMON, a generic C++ optimization library.
alpar@305: *
alpar@305: * Copyright (C) 2003-2008
alpar@305: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@305: * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@305: *
alpar@305: * Permission to use, modify and distribute this software is granted
alpar@305: * provided that this copyright notice appears in all copies. For
alpar@305: * precise terms see the accompanying LICENSE file.
alpar@305: *
alpar@305: * This software is provided "AS IS" with no warranty of any kind,
alpar@305: * express or implied, and with no claim as to its suitability for any
alpar@305: * purpose.
alpar@305: *
alpar@305: */
alpar@305:
kpeter@306: namespace lemon {
alpar@305: /*!
alpar@305:
alpar@305: \page migration Migration from the 0.x Series
alpar@305:
alpar@305: This guide gives an in depth description on what has changed compared
kpeter@306: to the 0.x release series.
alpar@305:
alpar@305: Many of these changes adjusted automatically by the
alpar@305: script/lemon-0.x-to-1.x.sh tool. Those requiring manual
alpar@305: update are typeset boldface.
alpar@305:
alpar@305: \section migration-graph Graph Related Name Changes
alpar@305:
kpeter@306: - \ref concepts::Digraph "Directed graphs" are called \c Digraph and
kpeter@306: they have Arcs (instead of Edges), while
kpeter@306: \ref concepts::Graph "undirected graphs" are called \c Graph
kpeter@306: (instead of \c UGraph) and they have Edges (instead of
kpeter@306: UEdges). These changes reflected thoroughly everywhere in
alpar@305: the library. Namely,
alpar@305: - \c Graph -> \c Digraph
kpeter@306: - \c %ListGraph -> \c ListDigraph, \c %SmartGraph -> \c SmartDigraph etc.
alpar@305: - \c UGraph -> \c Graph
alpar@305: - \c ListUGraph -> \c ListGraph, \c SmartUGraph -> \c SmartGraph etc.
kpeter@306: - \c Edge -> \c Arc, \c UEdge -> \c Edge
kpeter@306: - \c EdgeMap -> \c ArcMap, \c UEdgeMap -> \c EdgeMap
kpeter@306: - \c EdgeIt -> \c ArcIt, \c UEdgeIt -> \c EdgeIt
kpeter@306: - Class names and function names containing the words \c graph,
kpeter@306: \c ugraph, \e edge or \e arc should also be updated.
alpar@305: - The two endpoints of an (\e undirected) \c Edge can be obtained by the
kpeter@306: u() and v() member function of the graph
alpar@305: (instead of source() and target()). This change
alpar@305: must be done by hand.
alpar@305: \n Of course, you can still use source() and target()
alpar@305: for Arcs (directed edges).
alpar@305:
kpeter@306: \warning
kpeter@306: The script/lemon-0.x-to-1.x.sh tool replaces all instances of
kpeter@306: the words \c graph, \c digraph, \c edge and \c arc, so it replaces them
kpeter@306: in strings, comments etc. as well as in all identifiers.
kpeter@306:
alpar@305: \section migration-lgf LGF tools
alpar@305:
alpar@305: \section migration-search BFS, DFS and Dijkstra
kpeter@306: - Using the function interface of BFS, DFS and %Dijkstra both source and
kpeter@306: target nodes can be given as parameters of the run() function
kpeter@306: (instead of \c bfs(), \c dfs() or \c dijkstra() itself).
kpeter@306: - \ref named-templ-param "Named class template parameters" of \c Bfs,
kpeter@306: \c Dfs, \c Dijkstra, \c BfsVisit, \c DfsVisit are renamed to start
kpeter@306: with "Set" instead of "Def". Namely,
kpeter@306: - \c DefPredMap -> \c SetPredMap
kpeter@306: - \c DefDistMap -> \c SetDistMap
kpeter@306: - \c DefReachedMap -> \c SetReachedMap
kpeter@306: - \c DefProcessedMap -> \c SetProcessedMap
kpeter@306: - \c DefHeap -> \c SetHeap
kpeter@306: - \c DefStandardHeap -> \c SetStandardHeap
kpeter@306: - \c DefOperationTraits -> \c SetOperationTraits
kpeter@306: - \c DefProcessedMapToBeDefaultMap -> \c SetStandardProcessedMap
alpar@305:
alpar@305: \section migration-error Exceptions and Debug tools
alpar@305:
alpar@305: \section migration-other Others
kpeter@306: - The contents of graph_utils.h are moved to core.h
kpeter@306: and maps.h. core.h is included by all graph types,
kpeter@306: therefore it usually do not have to be included directly.
kpeter@306: - path_utils.h is merged to \c path.h.
kpeter@306: - The parameters of the graph copying tools (i.e. \c GraphCopy,
kpeter@306: \c DigraphCopy) have to be given in the from-to order.
kpeter@306: - \c copyDigraph() and \c copyGraph() are renamed to \c digraphCopy()
kpeter@306: and \c graphCopy(), respectively.
kpeter@306: - The of
kpeter@306: - DefXyzMap --> SetXyzMap
kpeter@306: - DefHeap --> SetHeap
kpeter@306: - DefStandardHeap --> SetStandardHeap
kpeter@306: - DefOperationTraits --> SetOperationTraits
kpeter@306: - DefProcessedMapToBeDefaultMap --> SetStandardProcessedMap
kpeter@306: - Some map types should also been renamed. Namely,
kpeter@306: - \c IntegerMap -> \c RangeMap
kpeter@306: - \c StdMap -> \c SparseMap
kpeter@306: - \c FunctorMap -> \c FunctorToMap
kpeter@306: - \c MapFunctor -> \c MapToFunctor
kpeter@306: - \c ForkWriteMap -> \c ForkMap
kpeter@306: - \c StoreBoolMap -> \c LoggerBoolMap
kpeter@306: - \c dim2::BoundingBox -> \c dim2::Box
kpeter@306:
alpar@305: */
kpeter@306: }