COIN-OR::LEMON - Graph Library

Changeset 1583:2b329fd595ef in lemon-0.x for demo/dijkstra_demo.cc


Ignore:
Timestamp:
07/22/05 17:15:29 (15 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2085
Message:

Documented some more demo programs.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/dijkstra_demo.cc

    r1530 r1583  
     1/* -*- C++ -*-
     2 * demo/lp_maxflow_demo.cc - Part of LEMON, a generic C++ optimization library
     3 *
     4 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     6 *
     7 * Permission to use, modify and distribute this software is granted
     8 * provided that this copyright notice appears in all copies. For
     9 * precise terms see the accompanying LICENSE file.
     10 *
     11 * This software is provided "AS IS" with no warranty of any kind,
     12 * express or implied, and with no claim as to its suitability for any
     13 * purpose.
     14 *
     15 */
     16
     17///\ingroup demos
     18///\file
     19///\brief Demonstrating LEMON implementation of the Dijkstra algorithm
     20///
     21/// Dijkstra's algorithm computes shortest paths between two nodes in
     22/// a graph with edge lengths. Here we only show some of the
     23/// facilities supplied by our implementation: for the detailed
     24/// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this".
     25
    126#include <iostream>
    227
     
    5277    std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
    5378
    54     std::cout << "Dijkstra algorithm test..." << std::endl;
     79    std::cout << "Dijkstra algorithm demo..." << std::endl;
    5580
    5681
Note: See TracChangeset for help on using the changeset viewer.