Definition

A Graph with self-loops. That is, a graph where the vertex pair that makes an edge is itself. For example,

graph LR;
	A((A)) o--o A((A))

Mermaid has poor support for self loops so they look like this. See this to check if it’s been fixed yet.