Big talk data structure 21: adjacency Multiple tables of the graph's storage structure

1. Introduction:

To remove the edge of the Left (V0,V2), you need to delete two nodes from the shadow of the table below.

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

2. Storage structure adjacent to multiple tables:

Ivex and Jvex: the subscript of two vertices attached to a certain edge in the vertex table.

Ilink: Points to the next edge of the attached vertex ivex.

Jlink: Points to the next edge of the attached vertex jvex.

3. adjacency Multiple Representation Intent drawing:

Author: csdn Blog zdp072