给定一个n个结点的连通图，用回溯法求出图中含有的所有哈密尔顿环。包含实验报告。 -given a n nodes in a graph, with retrospective method, the map contains all the Hamilton Central. The report contains experiments.

用c语言实现的校园导航，包含多个顶点的无向图。具体功能有，最短路径，最佳路径（汉米尔顿回路）。-With c language campus navigation, multiple vertices undirected graph. Specific function, shortest path, the best path (Hamilton circuit).