rar

In the traversal of the graph

  • 2014-03-05
  • 23.3KB
  • Points it Requires : 2

In the traversal of a graph, since any vertex of the graph may be adjacent to other vertices, after visiting a vertex, you may return to the vertex after searching along a certain path. In order to avoid the same vertex being visited multiple times, each visited vertex must be recorded in the process of traversing the graph. Depth-first search starts from a vertex v in the graph, visits this vertex, and then traverses the graph in depth from the unvisited adjacent points of v in turn. The process of traversing the graph is essentially the process of finding the adjacent points of each vertex. The time it takes depends on the storage structure used.

unfold

You Might Like

Uploader
lamas
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×