Incidence list
From Wikipedia, the free encyclopedia
 |
This article may require cleanup to meet Wikipedia's quality standards. (Consider using more specific cleanup instructions.) Please help improve this article if you can. The talk page may contain suggestions. (March 2009) |
In graph theory, the incidence list is a variant of the adjacency list that allows for the description of the edges at the cost of additional edges. Instead of storing adjacent vertices, the list stores all of the edges that contain the referencing vertex. Edges are required to have two vertices. This variant was conceived by Goodrich and Tamassia.[1]
[edit] References
- ^ M. T. Goodrich and R. Tamassia (1998). Data Structures and Algorithms in Java. Wiley, New York, NY.
.svg){kind=small} |
This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
