Description: For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stack, push, pop, take the top element, sub-stack is empty ) to achieve depth-first search graph traversal and breadth-first search traversal algorithm.
To Search:
- [tubianli] - Graph traversal depth and breadth of the
File list (Check if you may need any files):
pic.c
02 Java语法.ppt
Download