# Concept Distributed Vertex List Graph

Contents

- Description
- Notation
- Refinement of
- Associated types
- Valid Expressions
- Models

# Description

A Distributed Vertex List Graph is a graph whose vertices are distributed across multiple processes or address spaces. The `vertices` and `num_vertices` functions retain the same signatures as in the Vertex List Graph concept, but return only the local set (and size of the local set) of vertices.

# Notation

G
  A type that models the Distributed Vertex List Graph concept.
g
  An object of type `G`.

# Refinement of

> - Graph

# Associated types

Vertex descriptor type | `graph_traits<G>::vertex_descriptor` | Must model the Global Descriptor concept.
Vertex iterator type | `graph_traits<G>::vertex_iterator` | Iterates over vertices stored locally. The value type must be `vertex_descriptor`.
Vertices size type | `graph_traits<G>::vertices_size_type` | The unsigned integral type used to store the number of vertices in the local subgraph.

# Valid Expressions

Name | Expression | Type | Semantics
--- | --- | --- | ---
Local vertex set | `vertices(g)` | `std::pair<` `vertex_iterator,` `vertex_iterator>` | Returns an iterator range providing access to the local vertices in the graph.
Number of local vertices. | `num_vertices(g)` | `vertices_size_type` | Returns the number of vertices stored locally in the graph.

# Models

> - Distributed adjacency list

Copyright (C) 2005 The Trustees of Indiana University.

Authors: Douglas Gregor and Andrew Lumsdaine