光与数据结构的笔记 把书上重要的内容都写下来了 希望对大家有帮助-Optical data structure with the notes on the book important to write down everything you want to help

用图的相关算法，解决清华园旅游问题，包括计算游览完不包括教学楼的所有景点需要的次数，找出最长的最短路径最小的点，计算铺设能到达所有景点的光纤的最小长度及路径。通过实验掌握图的表示方法和算法。-With related algorithms map, solve Tsinghua tourism issues, including the calculation does not include the number of times after visiting all the attracti