Shulou(Shulou.com)06/02 Report--

In view of how to complete the traversal of the graph in the data structure and algorithm of C language, this article introduces the corresponding analysis and solution in detail, hoping to help more partners who want to solve this problem to find a more simple and feasible method.

Preface

We choose to use breadth-first search to traverse this graph-> the results are as follows:

Breadth-first search process

The process of using breadth-first search to traverse this graph is as follows.

First, take an unvisited vertex as the starting vertex, such as point 1 as the starting vertex.

Put point 1 in the queue, and then put the unvisited vertex adjacent to point 1, that is, vertex 2, 3 and 5, into the queue in turn, as shown in the following figure:

Next, put the unvisited vertex 4 adjacent to vertex 2 into the queue. All the vertices have been visited so far, and the traversal is over. As shown below:

Main ideas

First, access all its adjacent points with an unvisited vertex as the starting vertex

Then for each adjacent point, visit their adjacent unvisited vertices until all the vertices have been visited and the traversal is over.

Code implementation # include int main () {int I, j, m, a, b, cur,n, book [101] = {0}, e [101] [101]; int que [10001], head, tail; scanf ("% d% d", & n, & m); / / initialize two-dimensional matrix for (I = 1; I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.