课程设计-邻接表---副本.docVIP

摘 要 本课程设计主要实现用邻接表存储结构对图进行操作。在课程设计中，程序以邻接表对图进行存储，并利用数组、队列等结构加以辅助存储；最终实现图的建立，图的链表结构的输出，图的深度优先遍历及广度优先遍历。 关键字: 图 邻接表 队列 遍历 Abstract This curriculum design is designed to achieve operations of graph with adjacency table storage structure.In the curriculum design, the program is stored wiht the adjacency table, and be assisted by arrays, queue, and so on.Finally, to achieve the construction of a graph, output the list structure of the graph, depth-first traversal graph and breadth-first traversal graph. Keyword: Graph Adjacency list Queue Traversal 1.引 言 本学期我们学习了