#dynamic-programming #search-algorithms #search #path #viterbi #a-star #events

tetengo_lattice

A library for Viterbi search and A* algorithm implementation

6 stable releases

1.3.0 Sep 16, 2024
1.2.4 Nov 9, 2024
1.2.3 Oct 14, 2024
1.2.2 Sep 16, 2024
1.1.0 Jul 28, 2024

#596 in Algorithms

Download history 564/week @ 2024-09-13 77/week @ 2024-09-20 86/week @ 2024-09-27 16/week @ 2024-10-04 167/week @ 2024-10-11 34/week @ 2024-10-18 8/week @ 2024-10-25 45/week @ 2024-11-01 159/week @ 2024-11-08 52/week @ 2024-11-15 19/week @ 2024-11-22 3/week @ 2024-11-29

236 downloads per month

MIT license

165KB
4K SLoC

tetengo Lattice 1.2.4

A Viterbi search library.

The Viterbi search is a dynamic programming algorithm. It finds the most likely path in a lattice consisting of observed event nodes.

This library also provides the A* search algorithm for the lattice created by the Viterbi search.

How to Use

Execute the cargo add command to add the "tetengo_lattice" library to your cargo package.

An entry for "tetengo_lattice" will be added to the "dependencies" section of Cargo.toml.

  • On Windows:
    • X:>cd \path\to\your\package
      X:>cargo add tetengo_lattice
      
  • On Linux:
    • $ cd /path/to/your/package
      $ cargo add tetengo_lattice
      

See the cargo document for details.

Source Files

The source files for this library are available on GitHub.


Copyright (C) 2023-2024 kaoru https://www.tetengo.org/

This product is released under the MIT license. See the LICENSE file for details.

Dependencies

~2.5MB
~41K SLoC