* src/twaalgos/randomgraph.hh: Fix comments.
This commit is contained in:
parent
337925c94a
commit
db99f3bd3c
1 changed files with 4 additions and 1 deletions
|
|
@ -30,7 +30,7 @@
|
||||||
namespace spot
|
namespace spot
|
||||||
{
|
{
|
||||||
/// \ingroup twa_misc
|
/// \ingroup twa_misc
|
||||||
/// \brief Construct a tgba randomly.
|
/// \brief Construct a twa randomly.
|
||||||
///
|
///
|
||||||
/// \param n The number of states wanted in the automata (>0). All states
|
/// \param n The number of states wanted in the automata (>0). All states
|
||||||
/// will be connected, and there will be no dead state.
|
/// will be connected, and there will be no dead state.
|
||||||
|
|
@ -79,6 +79,9 @@ namespace spot
|
||||||
/// \f$1+(n-1)d\f$ and variance \f$(n-1)d(1-d)\f$. (This is less
|
/// \f$1+(n-1)d\f$ and variance \f$(n-1)d(1-d)\f$. (This is less
|
||||||
/// accurate, but faster than considering all possible \a n
|
/// accurate, but faster than considering all possible \a n
|
||||||
/// successors one by one.)
|
/// successors one by one.)
|
||||||
|
///
|
||||||
|
/// Note that while this constructs an automaton with random
|
||||||
|
/// acceptance sets, this does not set the acceptance condition.
|
||||||
SPOT_API twa_graph_ptr
|
SPOT_API twa_graph_ptr
|
||||||
random_graph(int n, float d,
|
random_graph(int n, float d,
|
||||||
const atomic_prop_set* ap, const bdd_dict_ptr& dict,
|
const atomic_prop_set* ap, const bdd_dict_ptr& dict,
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue