Big talk data structure 22: An array of edge sets for the storage structure of graphs

1. Introduction to the Edge set array:

An array of side sets is composed of two one-dimensional arrays:

1.) A storage vertex information.

2.) A storage edge of the information, the edge of the array of each data element by a side of the beginning of the subscript (begin), end of the subscript (ends), Hequan (weight) composition.

More Wonderful content: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/

2. Edge set Array suitable scenario:

An array of edge sets is concerned with the collection of edges, and the degree of finding a vertex in an array of edge sets needs to scan the entire array of edges, which is not efficient.

It is therefore better suited for operations that are processed in sequence, rather than for vertex-related operations.

Author: csdn Blog zdp072