Implement the Depth First Search Algorithm in Graph using Simple
- 时间:2020-09-19 10:45:07
- 分类:网络文摘
- 阅读:99 次
Given a graph represented by G(V, E) where V is the vertices and E represents the edges, we can do a Depth First Search Algorithm (DFS) on any node/vertex. The DFS will mark the current node visited and visit the node using using the (*visit) function (C++ function pointer), and recursively call itself with the connected edges.
1 2 3 4 5 6 7 8 9 10 | void traverseDepthFirstSearch(int node, void(*visit)(int)) { link t; (*visit)(k); visited[k] = 1; // mark the node as visited for (t = adj[k]; t != NULL; t = t->next) { if (!visited[t->v]) { // avoid cycle traverseDepthFirstSearch(t->v, visit); } } } |
void traverseDepthFirstSearch(int node, void(*visit)(int)) { link t; (*visit)(k); visited[k] = 1; // mark the node as visited for (t = adj[k]; t != NULL; t = t->next) { if (!visited[t->v]) { // avoid cycle traverseDepthFirstSearch(t->v, visit); } } }

three-nodes
The algorithimic complexity is O(N) where N is the number of nodes connected to the given vertex. The space complexity is also O(N).
–EOF (The Ultimate Computing & Technology Blog) —
推荐阅读:Blogging Local: How to Find Freelancing Gigs in Your City Trump Answers Twitter’s Questions During Monday’s #AskTrump When Your Blog Attracts the Wrong Readers, What You Can Do About 5 Tips for Bloggers to Stay Healthy Sanders Live-Tweets Republican Debate How to Check If Four Points can Make a Valid Square (C++ and Jav Python: Understanding the Importance of EigenValues and EigenVec How to Compute Kth Largest Element in a Stream? How to Flip Equivalent Binary Trees? How to Implement Quicksort Algorithm in Python – the Pytho
- 评论列表
-
- 添加评论