一个自己写的设置SNAKE初始节点的MATLAB程序,以绿色十字标记节点位置,在此基础上可以编制自己的SNAKE算法,-himself wrote a set of Snake initial nodes MATLAB procedures to Green Cross markings node location, on this basis can prepare their own Snake algorithm, huh

画拓扑图节点技术，以及构造拓扑节点算法 ，可以根据该程序学习如何画拓扑图，

大学网络课程--距离矢量路由算法（DJ） 可以获得每个节点的路由信息-University online courses- distance vector routing algorithm (DJ) can get the routing information for each node

任意生成一个M*N的矩阵，并根据深度优先算法和广度优先算法寻找一条或多条最短路径，通过图形化的界面标记输出各个节点的坐标。要求迷宫是随机并且是连通的。-Optionally generate an M* N matrix, and to find one or more shortest path first algorithm according to the depth and breadth-first algorithm, through a graphical interface ma