COPYING
author alpar
Sun, 06 Feb 2005 14:44:41 +0000
changeset 1128 6a347310d4c2
parent 760 49d4fe04fbc0
permissions -rw-r--r--
Several important changes:
- Named parameters for setting ReachedMap
- run() is separated into initialization and processing phase
- It is possible to run Dijkstra from multiple sources
- It is possible to stop the execution when a destination is reached.
     1 LEMON as a whole is copyrighted by Egerváry Jenő Kombinatorikus
     2 Optimalizálási Kutatócsoport (Egervary Combinatorial Optimization
     3 Research Group, EGRES).
     4 
     5 You are free to use, modify and distribute LEMON under the terms
     6 described in the LICENSE file.
     7 
     8 This project is supported by
     9 
    10 * Egyetemközi Távközlési és Informatikai Központ (Inter-University
    11   Centre for Telecommunications and Informatics, Hungary)
    12 
    13 * Traffic Analysis and Network Performance Laboratory,
    14   Ericsson Research, Hungary
    15 
    16 * Department of Operations Research, Eötvös Loránd University,
    17   Budapest