图发生列表实现 [英] Graph incidence list implementation
问题描述
我正在考虑图形数据结构的实现，并正在研究发生率列表表示。这里有一个简要说明：
I'm considering graph data structure implementations and am looking at the "incidence list" representation. There is a brief description of it here:
因此，图表中的每个顶点都存储了它出现的边界列表。
So each vertex in the graph stores a list of those edges upon which it is incident.
鉴于我的图形是一个有向图，从这个描述中可以看出几点：
Given that my graph is a directed graph, I'm not very clear from this description on a couple of points:
- 图形本身也存储所有边的列表？
- 做顶点只存储传出边缘，还是传入和传出？
- 如果两者都是在单独的列表中？
我对其他图表表示（邻接表，邻接矩阵，边界列表，关联矩阵） ，所以这不是一个关于图形实现的问题，只是这个特定的问题。
I'm quite familiar with the other graph representations (adjacency list, adjacency matrix, edge list, incidence matrix), so this isn't a question about graph implementations in general, just this particular one.
任何指针都会很感激。
推荐答案
经过深入研究和思考，我得出这样的结论：没有发生列表图数据结构化。
我认为维基百科的文章是作者脑海中一些混淆的产物。
感谢大家阅读这个问题并随时随地使用它。
Having researched and thought about it further, I've come to the conclusion that there isn't an incidence list graph data strucure. I think that the Wikipedia article was the product of some confusion in the author's mind. Thanks to everyone who read this question and spent any time on it.
Armand
这篇关于图发生列表实现的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
