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" 0 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]:=
 Out[1]=

### Options (5)

#### Labels (2)

By default, ChordDiagram uses VertexList as labels:

 In[2]:=
 In[3]:=
 Out[3]=
 In[4]:=
 Out[4]=

Use an explicit list of strings to overwrite this:

 In[5]:=
 Out[5]=

#### TrimEdges (2)

For realistic datasets, many edges may suffer from small weights:

 In[6]:=
 Out[6]=

Use TrimEdges to drop the lowest edge weights:

 In[7]:=
 Out[7]=

#### Interactive (1)

 In[8]:=
 Out[8]=

### Applications (2)

Using a directed graph to show asymmetric ribbon widths:

 In[9]:=

 In[10]:=
 In[11]:=
 Out[11]=

### Properties and Relations (1)

By default, the function accepts a weighted graph. If you instead have a weighted adjacency matrix, this can be converted to a weighted graph first:

 Out[25]=
 In[26]:=
 In[27]:=
 Out[27]=
 In[28]:=
 Out[28]=

## Publisher

Georgios Varnavides

## Version History

• 1.0.0 – 08 August 2019