COIN-OR::LEMON - Graph Library

Ticket #289: 289-tutorial-2965b19071f7.patch

File 289-tutorial-2965b19071f7.patch, 691 bytes (added by Peter Kovacs, 11 years ago)
  • intro.dox

    # HG changeset patch
    # User Peter Kovacs <kpeter@inf.elte.hu>
    # Date 1242052571 -7200
    # Node ID 2965b19071f779e17819ff7dc609cc1fea95ab95
    # Parent  3e28dbeed635902616afbefcb4179df55b36ec1b
    Change the explanation of the acronym LEMON (#289)
    
    diff --git a/intro.dox b/intro.dox
    a b  
    2121
    2222[SEC]intro_lemon[SEC] What is LEMON
    2323
    24 <b>LEMON</b> stands for <b>L</b>ibrary of <b>E</b>fficient <b>M</b>odels and
     24<b>LEMON</b> stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling and
    2525<b>O</b>ptimization in <b>N</b>etworks. It is a C++ template
    2626library aimed at combinatorial optimization tasks, especially those
    2727working with graphs and networks.