Feng Gui-lian
Abstract
This paper analyzes carefully the Depth-first Search Algorithm of the Graph that regarded the adjacency list as storage structure through particular examples,and also analyzes the whole program realized in vc++.At last,it produces some application based on this algorithm.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper analyzes carefully the Depth-first Search Algorithm of the Graph that regarded the adjacency list as storage structure through particular examples,and also analyzes the whole program realized in vc++.At last,it produces some application based on this algorithm.
Key concepts: Adjacency list, Breadth-first search, Depth-first search, Computer science, Graph, Search algorithm, Algorithm, Adjacency matrix