前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布

DFS

作者头像
lonelydawn
发布2018-02-09 11:35:06
4930
发布2018-02-09 11:35:06
举报
文章被收录于专栏:lonelydawn的前端猿区

Definition

First, choosing a beginning point V and mark it as an already visited one. Then, starting from the V to search for each point W closed to V.  If W has not been visited, then taking W as the new beginning  to loop the depth first traversal. Until all the reachable vertices from the beginning V have been visited, the loop ends.

  If there is still no reachable vertices in this graph, just choosing another vertex which has not been accessed as a new beginning point to repeat the above process until all vertices in the graph have been visited.

Status

Depth first search is a classical algorithm in graph theory. Using DFS can generate the corresponding target topology diagram sorting table which can easily solve many problems related to graph theory, such as the maximum path problem and so on.

Algorithm

Example

本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Definition
  • Status
  • Algorithm
  • Example
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档