API for pmcharrison/seqopt
Finding optimal sequences with dynamic programming
| Global functions | |
|---|---|
| check_cost_fun | Source code |
| check_inputs | Source code |
| cost_by_prev_state | Man page Source code |
| cost_fun | Man page Source code |
| find_path | Source code |
| first_iter | Source code |
| get_initial_costs | Source code |
| has_reverse | Man page Source code |
| init_best_prev_states | Source code |
| init_costs | Source code |
| is.cost_fun | Man page Source code |
| is_context_sensitive | Man page Source code |
| is_symmetric | Man page Source code |
| is_vectorised | Man page Source code |
| normalise | Source code |
| print.cost_fun | Source code |
| rest_iter | Source code |
| seq_cost | Man page Source code |
| seq_opt | Man page Source code |
| summarise_problem | Source code |
