Data Structure For Representing A Graph Combination Of Linked List And Hash Table | Awesome Learning to Hash Add your paper to Learning2Hash

Awesome Learning to Hash

A Webpage dedicated to the latest research on Hash Function Learning. Maintained by Sean Moran.

Contact Sean Moran about this survey or website. Made with Jekyll and Hyde.

Data Structure For Representing A Graph Combination Of Linked List And Hash Table

Kolosovskiy Maxim A. Altai State Technical University, Russia. Arxiv 2009

[Paper]    
ARXIV Graph

In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data structure can fast add and search edges (advantages of adjacency matrix), use linear amount of memory, let to obtain adjacency list for certain vertex (advantages of collection of adjacency lists). Basic knowledge of linked lists and hash tables is required to understand this article. The article contains examples of implementation on Java.

Similar Work