例1.txt

贝叶斯决策解决城市最短路径问题,人工只能实验项目

3,5
3,5,2
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15
2,3,6,5,4,7,8,9,1,22,55,66,88,44,66,545,44,2,5,6,4,-5,-9,-6,-4
-1,-2,-6,-5,-4,-8,-9,-7,0,6