Graph Representation

Graph Representation

D. Dominguez-Sal (Universitat Politècnica de Catalunya, Spain), V. Muntés-Mulero (Universitat Politècnica de Catalunya, Spain), N. Martínez-Bazán (Universitat Politècnica de Catalunya, Spain) and J. Larriba-Pey (Universitat Politècnica de Catalunya, Spain)
Copyright: © 2012 |Pages: 28
DOI: 10.4018/978-1-61350-053-8.ch001
OnDemand PDF Download:
No Current Special Offers


In this chapter, we review different graph implementation alternatives that have been proposed in the literature. Our objective is to provide the readers with a broad set of alternatives to implement a graph, according to their needs. We pay special attention to the techniques that enable the management of large graphs. We also include a description of the most representative libraries available for representing graphs.
Chapter Preview

Classical Structures For Representing Graphs

In this section, we introduce some of the most popular data structures for representing graphs. They are important because some of the techniques described later in the chapter are based on these data structures. We summarize the representations described in this section in Figure 1, depicting the four different graph representations for a sample graph.

Figure 1.

(a) Sample graph represented as (b) adjacency matrix, (c) adjacency lists, (d) incidence matrix, (e) laplacian matrix


Complete Chapter List

Search this Book: