Function Repository Resource:

ChordDiagram

Make a weighted connectivity graph using circular embedding

Contributed by: Georgios Varnavides

ResourceFunction["ChordDiagram"][graph]

generates a chord diagram using a weighted graph.

Details and Options

ResourceFunction["ChordDiagram"] requires an edge-weighted graph as input.

ResourceFunction["ChordDiagram"] draws each vertex of the weighted graph as a wedge, with width proportional to its WeightedAdjacencyMatrix row total.

ResourceFunction["ChordDiagram"] draws a ribbon made from two Poincaré arcs for each directed edge.

The following options can be specified:

"Labels"

Automatic

choose the vertex labels

"Colors"

Automatic

choose the ribbon colors for each edge

"BackgroundOpacity"

0.25

set the background ribbon opacity

"Interactive"

False

include interactive mouseover

"TrimEdges"

trim edges with small weights

Use "TrimEdges"→n to avoid multiple thin ribbons in the resulting graphic.

"Labels"→Automatic uses the vertex labels given by VertexList[graph].

"Colors"→Automatic uses random colors.

Examples

Basic Examples (1)

A chord diagram with simple weighted graph:

In[1]:=

$wg = Graph[{1 \[DirectedEdge] 3, 1 \[DirectedEdge] 2, 2 \[DirectedEdge] 1, 3 \[DirectedEdge] 2, 3 \[DirectedEdge] 1}, EdgeWeight -> {1, 2, 1, 3, 2}]; ResourceFunction["ChordDiagram"][wg]$

Out[1]=

Options (5)

Labels (2)

By default, ChordDiagram uses VertexList as labels:

In[2]:=

$wg = Graph[{1 \[DirectedEdge] 3, 1 \[DirectedEdge] 2, 2 \[DirectedEdge] 1, 3 \[DirectedEdge] 2, 3 \[DirectedEdge] 1}, EdgeWeight -> {1, 2, 1, 3, 2}];$

In[3]:=

Out[3]=

In[4]:=

Out[4]=

Use an explicit list of strings to overwrite this:

In[5]:=

$wg = Graph[{1 \[DirectedEdge] 3, 1 \[DirectedEdge] 2, 2 \[DirectedEdge] 1, 3 \[DirectedEdge] 2, 3 \[DirectedEdge] 1}, EdgeWeight -> {1, 2, 1, 3, 2}]; ResourceFunction["ChordDiagram"][wg, "Labels" -> {"A", "B", "C"}]$