Commit 383c9fd2 authored by Tomáš Pecka's avatar Tomáš Pecka Committed by Ing. Jan Trávníček

algo: Fix parameter documentation in random automaton generators

parent e8484a52
......@@ -62,7 +62,7 @@ auto GenerateNFA1 = registration::AbstractRegister < automaton::generate::Random
"Generates a random finite automaton.\n\
@param statesCount number of states in the generated automaton\n\
@param alphabet Input alphabet of the automaton\n\
@param density density of the transition function\n\
@param density density of the transition function (0-100)\n\
@return random nondeterministic finite automaton" );
auto GenerateNFA2 = registration::AbstractRegister < automaton::generate::RandomAutomatonFactory, automaton::NFA < std::string, unsigned >, size_t, size_t, bool, double > ( automaton::generate::RandomAutomatonFactory::generateNFA, abstraction::AlgorithmCategories::AlgorithmCategory::DEFAULT, "statesCount", "alphabetSize", "randomizedAlphabet", "density" ).setDocumentation (
......@@ -71,7 +71,7 @@ auto GenerateNFA2 = registration::AbstractRegister < automaton::generate::Random
@param statesCount number of states in the generated automaton\n\
@param alphabetSize size of the alphabet (1-26)\n\
@param randomizedAlphabet selects random symbols from a-z range if true\n\
@param density density of the transition function (0-1). 1 means every possible transition is created\n\
@param density density of the transition function (0-100). 100 means every possible transition is created\n\
@return random nondeterministic finite automaton" );
} /* namespace */
......@@ -52,7 +52,7 @@ public:
*
* \param statesCount number of states in the generated automaton
* \param alphabet Input alphabet of the automaton
* \param density density of the transition function
* \param density density of the transition function (double from interval 0-100)
*
* \return random nondeterministic finite automaton
*/
......@@ -67,7 +67,7 @@ public:
* \param statesCount number of states in the generated automaton
* \param alphabetSize size of the alphabet (1-26)
* \param randomizedAlphabet selects random symbols from a-z range if true
* \param density density of the transition function (0-1). 1 means every possible transition is created
* \param density density of the transition function (0-100). 100 means every possible transition is created
*
* \return random nondeterministic finite automaton
*/
......@@ -101,7 +101,7 @@ private:
*
* \param n number of states
* \param alphabet input alphabet
* \param density density of the transition function (0-1). 1 means every possible transition is created
* \param density density of the transition function (0-100). 100 means every possible transition is created
*
* \return the actual random nondeterministic automaton
*/
......
......@@ -91,7 +91,7 @@ auto GenerateNFTA2 = registration::AbstractRegister < automaton::generate::Rando
@param alphabetSize size of the alphabet (1-26)\n\
@param maxRank the maximum rank in the randomly generated alphabet\n\
@param randomizedAlphabet selects random symbols from a-z range if true\n\
@param density density of the transition function (0-1). 1 means every possible transition is created\n\
@param density density of the transition function (0-100). 100 means every possible transition is created\n\
@return random nondeterministic finite automaton" );
} /* namespace */
......@@ -68,7 +68,7 @@ public:
* \param alphabetSize size of the alphabet (1-26)
* \param maxRank the maximum rank in the randomly generated alphabet
* \param randomizedAlphabet selects random symbols from a-z range if true
* \param density density of the transition function (0-1). 1 means every possible transition is created
* \param density density of the transition function (0-100). 100 means every possible transition is created
*
* \return random nondeterministic finite automaton
*/
......@@ -102,7 +102,7 @@ private:
*
* \param n number of states
* \param alphabet input alphabet
* \param density density of the transition function (0-1). 1 means every possible transition is created
* \param density density of the transition function (0-100). 100 means every possible transition is created
*
* \return the actual random nondeterministic automaton
*/
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment