Search - shortest path

Search - shortest path - List

[Multimedia Develop] dtw DL : 0: 这个算法是基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，简单来说，就是通过构建一个邻接矩阵，寻找最短路径和。-This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, simply put, is by building an adjacency matrix, and find the shortest path.
Date : 2025-12-31 Size : 2kb User : 何明洋
[Multimedia Develop] CShortestLenPCB DL : 0: 采用分枝限界法进行求解最短路径长度的问题，是算法设计中的经典题目-Branch and Bound method used to solve the problem of the shortest path length, is the classic algorithm design topics
Date : 2025-12-31 Size : 1kb User : ao63173