Data structure for representing a graph: combination of linked list and hash table - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Data structure for representing a graph: combination of linked list and hash table - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: In this article we discuss a data structure, which combines advantages of twodifferent ways for representing graphs: adjacency matrix and collection ofadjacency lists. This data structure can fast add and search edges advantagesof adjacency matrix, use linear amount of memory, let to obtain adjacency listfor certain vertex advantages of collection of adjacency lists. Basicknowledge of linked lists and hash tables is required to understand thisarticle. The article contains examples of implementation on Java.



Author: Maxim A. Kolosovskiy Altai State Technical University, Russia

Source: https://arxiv.org/







Related documents