关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm

此算法是广度优先搜索的算法实现，已通过测验。-This algorithm is a breadth-first search algorithm, has passed the test.

求解最大连通区域 一个简单的广度优先搜索算法-Solving the biggest connected region with a simple breadth-first search algorithm

本文件包含最小生成树程序，深度优先搜索，广度优先搜索，prim算法等，满足对树状图学习的小伙伴们下载，绝对是良心推荐，可以直接运行程序。(This file contains minimum spanning tree program, depth first search, breadth first search, PRIM algorithm, etc., which satisfies the downloads of tree learning partners. It is abso