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

tetengo_lattice

A library for Viterbi search and A* algorithm implementation

10 stable releases

Uses new Rust 2024

new 1.4.0 Apr 19, 2025
1.3.2 Jan 5, 2025
1.3.0 Sep 16, 2024
1.2.5 Dec 22, 2024
1.1.0 Jul 28, 2024

#268 in Algorithms

Download history 128/week @ 2024-12-21 118/week @ 2024-12-28 165/week @ 2025-01-04 19/week @ 2025-01-11 8/week @ 2025-02-01 18/week @ 2025-02-08 2/week @ 2025-02-15 4/week @ 2025-02-22 22/week @ 2025-03-01

629 downloads per month

MIT license

155KB
3.5K SLoC

tetengo Lattice 1.4.0

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-2025 kaoru https://www.tetengo.org/

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

Dependencies

~2MB
~37K SLoC