Return an automaton containing only the transitions and states from the lightest path in automaton.
The algorithm can be:
"auto": uses "dijkstra" implementation for now."a-star""bellman-ford""dijkstra"Preconditions:
automaton must be tropical.See also:
In [1]:
import vcsn
In [2]:
%%automaton --strip aut
context = "lal_char(abcd), nmin"
$ -> 0
0 -> 1 <6>a
0 -> 2 <1>a
2 -> 3 <1>b
3 -> 3 <2>b
3 -> 4 <1>c
4 -> 1 <1>d
0 -> 5 <2>a
5 -> 1 <3>b
1 -> $
In [3]:
aut.lightest_automaton()
Out[3]:
In [4]:
aut.lightest_automaton("bellman-ford")
Out[4]: