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:
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
alpar@305: 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:
alpar@305: - Directed graphs are called \c Digraph and they have Arcs
alpar@305: instead of Edges, while the undirected graph is called \c
alpar@305: Graph (instead of \c UGraph) and they have Edges (instead
alpar@305: of UEdges). This changes reflected thoroughly everywhere in
alpar@305: the library. Namely,
alpar@305: - \c Graph -> \c Digraph
alpar@305: - \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.
alpar@305: - \c Edge -> \c Arc
alpar@305: - \c UEdge -> \c Edge
alpar@305: - \c EdgeMap -> \c ArcMap
alpar@305: - \c UEdgeMap -> \c EdgeMap
alpar@305: - Class names and function names containing the words \e edge or \e arc
alpar@305: should also be updated.
alpar@305: - The two endpoints of an (\e undirected) \c Edge can be obtained by the
alpar@305: u() and v() member function of the graph class
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:
alpar@305: \section migration-lgf LGF tools
alpar@305:
alpar@305: \section migration-search BFS, DFS and Dijkstra
alpar@305:
alpar@305: \section migration-error Exceptions and Debug tools
alpar@305:
alpar@305: \section migration-other Others
alpar@305: */