Detailed Description
\n-This program gives an example of how to read and write a digraph and additional maps from/to a stream or a file using the LGF format.
\n-The \"digraph.lgf\" file:
@nodes
\n-label
\n-0
\n-1
\n-2
\n-3
\n-4
\n-5
\n-6
\n-7
\n-@arcs
\n- label capacity
\n-0 1 0 16
\n-0 2 1 12
\n-0 3 2 20
\n-1 2 3 10
\n-1 4 4 10
\n-1 5 5 13
\n-2 3 6 10
\n-2 4 7 8
\n-2 6 8 8
\n-5 3 9 20
\n-3 6 10 25
\n-4 7 11 15
\n-5 7 12 15
\n-6 7 13 18
\n-@attributes
\n-source 0
\n-target 7
\n-And the program which reads it and prints the digraph to the standard output:
/* -*- mode: C++; indent-tabs-mode: nil; -*-
\n+This example shows how the argument parser can be used.
\n+/* -*- mode: C++; indent-tabs-mode: nil; -*-
\n *
\n * This file is a part of LEMON, a generic C++ optimization library.
\n *
\n- * Copyright (C) 2003-2009
\n+ * Copyright (C) 2003-2010
\n * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
\n * (Egervary Research Group on Combinatorial Optimization, EGRES).
\n *
\n * Permission to use, modify and distribute this software is granted
\n * provided that this copyright notice appears in all copies. For
\n * precise terms see the accompanying LICENSE file.
\n *
\n * This software is provided "AS IS" with no warranty of any kind,
\n * express or implied, and with no claim as to its suitability for any
\n * purpose.
\n *
\n */
\n #include <iostream>
\n-#include <lemon/smart_graph.h>
\n-#include <lemon/lgf_reader.h>
\n-#include <lemon/lgf_writer.h>
\n+#include <lemon/arg_parser.h>
\n using namespace lemon;
\n+int main(int argc, char **argv)
\n+{
\n+ // Initialize the argument parser
\n+ ArgParser ap(argc, argv);
\n+ int i;
\n+ std::string s;
\n+ double d = 1.0;
\n+ bool b, nh;
\n+ bool g1, g2, g3;
\n+ // Add a mandatory integer option with storage reference
\n+ ap.refOption("n", "An integer input.", i, true);
\n+ // Add a double option with storage reference (the default value is 1.0)
\n+ ap.refOption("val", "A double input.", d);
\n+ // Add a double option without storage reference (the default value is 3.14)
\n+ ap.doubleOption("val2", "A double input.", 3.14);
\n+ // Set synonym for -val option
\n+ ap.synonym("vals", "val");
\n+ // Add a string option
\n+ ap.refOption("name", "A string input.", s);
\n+ // Add bool options
\n+ ap.refOption("f", "A switch.", b)
\n+ .refOption("nohelp", "", nh)
\n+ .refOption("gra", "Choice A", g1)
\n+ .refOption("grb", "Choice B", g2)
\n+ .refOption("grc", "Choice C", g3);
\n+ // Bundle -gr* options into a group
\n+ ap.optionGroup("gr", "gra")
\n+ .optionGroup("gr", "grb")
\n+ .optionGroup("gr", "grc");
\n+ // Set the group mandatory
\n+ ap.mandatoryGroup("gr");
\n+ // Set the options of the group exclusive (only one option can be given)
\n+ ap.onlyOneGroup("gr");
\n+ // Add non-parsed arguments (e.g. input files)
\n+ ap.other("infile", "The input file.")
\n+ .other("...");
\n+ // Throw an exception when problems occurs. The default behavior is to
\n+ // exit(1) on these cases, but this makes Valgrind falsely warn
\n+ // about memory leaks.
\n+ ap.throwOnProblems();
\n+ // Perform the parsing process
\n+ // (in case of any error it terminates the program)
\n+ // The try {} construct is necessary only if the ap.trowOnProblems()
\n+ // setting is in use.
\n+ try {
\n+ ap.parse();
\n+\n int main() {
\n- SmartDigraph g;
\n- SmartDigraph::ArcMap<int> cap(g);
\n- SmartDigraph::Node s, t;
\n+ // Check each option if it has been given and print its value
\n+ std::cout << "Parameters of '" << ap.commandName() << "':\\n";
\n try {
\n-\n- arcMap("capacity", cap). // read the 'capacity' arc map into cap
\n- node("source", s). // read 'source' node to s
\n- node("target", t). // read 'target' node to t
\n- run();
\n-\n- std::cerr << "Error: " << error.what() << std::endl;
\n- return -1;
\n+ std::cout << " Value of -n: " << i << std::endl;
\n+ if(ap.given("val")) std::cout << " Value of -val: " << d << std::endl;
\n+ if(ap.given("val2")) {
\n+ d = ap["val2"];
\n+ std::cout << " Value of -val2: " << d << std::endl;
\n }
\n- std::cout << "A digraph is read from 'digraph.lgf'." << std::endl;
\n- std::cout << "Number of nodes: " << countNodes(g) << std::endl;
\n- std::cout << "Number of arcs: " << countArcs(g) << std::endl;
\n- std::cout << "We can write it to the standard output:" << std::endl;
\n- digraphWriter(g). // write g to the standard output
\n- arcMap("capacity", cap). // write cap into 'capacity'
\n- node("source", s). // write s to 'source'
\n- node("target", t). // write t to 'target'
\n- run();
\n+ if(ap.given("name")) std::cout << " Value of -name: " << s << std::endl;
\n+ if(ap.given("f")) std::cout << " -f is given\\n";
\n+ if(ap.given("nohelp")) std::cout << " Value of -nohelp: " << nh << std::endl;
\n+ if(ap.given("gra")) std::cout << " -gra is given\\n";
\n+ if(ap.given("grb")) std::cout << " -grb is given\\n";
\n+ if(ap.given("grc")) std::cout << " -grc is given\\n";
\n+ switch(ap.files().size()) {
\n+ case 0:
\n+ std::cout << " No file argument was given.\\n";
\n+ break;
\n+ case 1:
\n+ std::cout << " 1 file argument was given. It is:\\n";
\n+ break;
\n+ default:
\n+ std::cout << " "
\n+ << ap.files().size() << " file arguments were given. They are:\\n";
\n+ }
\n+ for(unsigned int i=0;i<ap.files().size();++i)
\n+ std::cout << " '" << ap.files()[i] << "'\\n";
\n return 0;
\n }
\n-SmartDigraph and SmartGraph classes.
LEMON Graph Format writer.
LEMON Graph Format reader.
int countNodes(const Graph &g)
Function to count the nodes in the graph.
Definition: core.h:252
int countArcs(const Graph &g)
Function to count the arcs in the graph.
Definition: core.h:356
DigraphReader< TDGR > digraphReader(TDGR &digraph, std::istream &is)
Return a DigraphReader class.
Definition: lgf_reader.h:1265
DigraphWriter< TDGR > digraphWriter(const TDGR &digraph, std::ostream &os)
Return a DigraphWriter class.
Definition: lgf_writer.h:980
A tool to parse command line arguments.
virtual const char * what() const
A short description of the exception.
Definition: error.h:49
#include <iostream>\n-
#include <lemon/smart_graph.h>\n-
#include <lemon/lgf_reader.h>\n-
#include <lemon/lgf_writer.h>\n+\n+\n+
#include <lemon/arg_parser.h>\n
\n Generated on Mon Jul 25 2022 18:36:57 for My Project by
![\"doxygen\"/](\"doxygen.svg\")
1.9.4\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -3,133 +3,122 @@\n \n \n \n My Project\n \n \n * demo\n-lgf_demo.cc File Reference\n+arg_parser_demo.cc File Reference\n Demo_Programs\n ***** Detailed Description *****\n-This program gives an example of how to read and write a digraph and additional\n-maps from/to a stream or a file using the LGF format.\n-The \"digraph.lgf\" file:\n-@nodes\n-label\n-0\n-1\n-2\n-3\n-4\n-5\n-6\n-7\n-@arcs\n-label capacity\n-0 1 0 16\n-0 2 1 12\n-0 3 2 20\n-1 2 3 10\n-1 4 4 10\n-1 5 5 13\n-2 3 6 10\n-2 4 7 8\n-2 6 8 8\n-5 3 9 20\n-3 6 10 25\n-4 7 11 15\n-5 7 12 15\n-6 7 13 18\n-@attributes\n-source 0\n-target 7\n-And the program which reads it and prints the digraph to the standard output:\n+This example shows how the argument parser can be used.\n /* -*- mode: C++; indent-tabs-mode: nil; -*-\n *\n * This file is a part of LEMON, a generic C++ optimization library.\n *\n-* Copyright (C) 2003-2009\n+* Copyright (C) 2003-2010\n * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport\n * (Egervary Research Group on Combinatorial Optimization, EGRES).\n *\n * Permission to use, modify and distribute this software is granted\n * provided that this copyright notice appears in all copies. For\n * precise terms see the accompanying LICENSE file.\n *\n * This software is provided \"AS IS\" with no warranty of any kind,\n * express or implied, and with no claim as to its suitability for any\n * purpose.\n *\n */\n-#include - \n
- lemon