Sometimes, nodes have more than one type of relationship between them. In that case, there can be more than one edge connecting the same two nodes. These kinds of graphs, where multiples parallel edges are allowed on the same nodes, are called multigraphs. We have to explicitly indicate whether a particular graph is a multigraph or not. Parallel edges may represent different types of relationships between the nodes.

A multigraph is shown in the following figure:

An example of a multidirectional relationship is if Mike and John are classmates are well as co-workers.