Line: 1 to 1  

ShortestDistance  
Line: 16 to 16  
template<class Arc> void ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false);  
Changed:  
< <   [bad link?]   
> >    
 fstshortestdistance [opts] a.fst [distance.txt] reverse: type = bool, default = false Perform in the reverse direction  
Changed:  
< <    
> >    
Examples 
Line: 1 to 1  

ShortestDistance  
Line: 71 to 71  
See here for a discussion on efficient usage.  
Added:  
> >  See Also  
References

Line: 1 to 1  

ShortestDistance  
Line: 67 to 67  
 
Added:  
> >  CaveatsSee here for a discussion on efficient usage.  
References 
Line: 1 to 1  

ShortestDistance  
Line: 29 to 29  
Added:  
> >  (TropicalWeight)  
Shortest distance from the initial state

Line: 1 to 1  

ShortestDistance  
Line: 9 to 9  
⊕sum of the weights of all the paths between p and q.
The weights must must be right (left) distributive if  
Changed:  
< <  and k closed (i.e., 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k +1} = 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k }).  
> >  and k closed (i.e., 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k +1} = 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k }) (valid for TropicalWeight ).  
Usage 
Line: 1 to 1  

ShortestDistance  
Line: 23 to 23  
Perform in the reverse direction   
Added:  
> >  Examples

State  Distance 

0 
0 
1 
3 
2 
5 
3 
7 
ShortestDistance(A, &distance); fstshortestdistance a.fst
State  Distance 

0 
10 
1 
7 
2 
7 
3 
3 
ShortestDistance(A, &distance, true); fstshortestdistance reverse A.fst
ShortestDistance:
 CyrilAllauzen  05 Jul 2007 \ No newline at end of file
META FILEATTACHMENT  attachment="shortestdistance.jpg" attr="" comment="Shortest distance input example" date="1184013116" name="shortestdistance.jpg" path="shortestdistance.jpg" size="9583" stream="shortestdistance.jpg" user="Main.CyrilAllauzen" version="1" 

Line: 1 to 1  

ShortestDistance  
Line: 9 to 9  
⊕sum of the weights of all the paths between p and q.
The weights must must be right (left) distributive if  
Changed:  
< <  and k closed (i.e., 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k +1} = 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k }).  
> >  and k closed (i.e., 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k +1} = 1 ⊕ x ⊕ x ^{2} ⊕ ... ⊕ x ^{ k }).  
Usage 
Line: 1 to 1  

Added:  
> > 
ShortestDistance
Description
This operation computes the shortest distance from the initial state to every state (when
The weights must must be right (left) distributive if
Usage
Complexity
References
 CyrilAllauzen  05 Jul 2007 