Description: [imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then visit the adjacent vertices ... and so on until finding B, the first to reach point B path, must be at least a few side paths. Queue used to achieve record was visited by the vertex. Each visit with the team atop the points are adjacent to the vertex, then t
- [graphshguang] - map the depth and breadth traversal prio
- [lsxprogram] - backtracking algorithm used parts of cut
- [PL0_PASCAL] - Technical papers, prepared by the PL0 PA
- [genBST] - generic binary search tree contains the
- [xianxingbiao] - attachment that [problem description] 1.
- [school] - VB database Profile : Student Informatio
- [shengdubianli] - 1. First of all selected map type (direc
- [backtraing] - * Parts cutting issues:* a given width W
- [StudentManagement] - Students in school management systems (B
- [student] - A more complete three-tier structure of
File list (Check if you may need any files):
Download