Two Efficient Graph Representations for SimpleTwo Efficient Graph Representations for Simple Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 93 === Representing graphs is a fundamental data-structuring problem. Adjacency matrices and adjacency lists are two well known representations. The operations on an adjacency matrix which contain adjacency test, inserting/deleting an edge can be done in constant time....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91938888012934084888 |