1. The topology was represented with scheme-tree and adjacency list in the new model with dada saved in the database, so that data redundancy had greatly reduced and evolution was depict distinctly.

2. Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list.

3. First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on.

4. Because of the inverse adjacency list structure, this algorithm is much simple and easy to be fulfilled.

5. According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.

6. Some preliminary analysis of the Adjacency List representation is presented, as well as some promising experimental results.

7. Fig basic operations, including search, traversal, delete, adjacency list and adjacency matrix conversion.

8. First, the constructional method of adjacency list is given; then on this basis a fast forming algorithm of sections in distribution network is put forward.

8. is a online sentence dictionary, on which you can find good sentences for a large number of words.

9. The formation and structural features of adjacency list are described.

10. The method takes station-train adjacency list as its basic data structure and rebuilds the rail-net with the restriction of train routes, to make the got-route data validity and rationality.

11. The COUNT field contains the in-degree of that vertex and LINK is a pointer to the first node on the adjacency list.

12. According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure.

13. Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store.

14. Based on analyzing existed structures of undigraph and characteristics of 2D drawing, Classified Adjacency List which is an improving structure of undigraph is presented.

15. Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.