29
个编辑
更改
无编辑摘要
* An implementation suggested by [[Guido van Rossum]] uses a [[hash table]] to associate each vertex in a graph with an [[array data structure|array]] of adjacent vertices. In this representation, a vertex may be represented by any hashable object. There is no explicit representation of edges as objects.<ref>{{cite web
* An implementation suggested by [[Guido van Rossum]] uses a [[hash table]] to associate each vertex in a graph with an [[array data structure|array]] of adjacent vertices. In this representation, a vertex may be represented by any hashable object. There is no explicit representation of edges as objects.<ref>{{cite web
--[[用户：黄秋莉|黄秋莉]][[用户讨论：黄秋莉|讨论]] 【审校】吉多·范罗苏姆（Guido van Rossum）提出一种实现方法：'''<font color="#ff8000">哈希表</font>'''，将图中的每个顶点与其相邻顶点采用一种'''<font color="#ff8000">数组</font>'''数据结构表示。在这种表示法中，顶点可以由任何散列对象表示，而连边没有被表示为对象。
| author = [[Guido van Rossum]]
| author = [[Guido van Rossum]]
作者: 吉多·范罗苏姆
作者: 吉多·范罗苏姆
--[[用户：黄秋莉|黄秋莉]][[用户讨论：黄秋莉|讨论]] 【审校】吉多·范罗苏姆（Guido van Rossum）
| year = 1998
| year = 1998