(data structure)

**Definition:**
A *graph* whose *edges* are unordered pairs of *vertices*, and the same pair of vertices can be connected by multiple edges.

**Formal Definition:** Same as graph, but E is a *bag* of edges, not a *set*.

**Generalization** (I am a kind of ...)

*graph*.

**Aggregate parent** (I am a part of or used in ...)

*Christofides algorithm*.

**See also**
*hypergraph*.

*Note:
A definition of "pseudograph" is a multigraph that may have self-loops.*

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 2 February 2006.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Paul E. Black, "multigraph", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 2 February 2006. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/multigraph.html