# Data structure

### Balanced matrix&#x20;

Creating a chord diagram with a balanced matrix involves using a square matrix where the rows and columns represent the same categories, and the values indicate the relationships or flows between them. A balanced matrix means that the sum of the rows equals the sum of the columns for each category, often used to visualize symmetric relationships or flows in a system.

|   | A | B | C |
| - | - | - | - |
| A | 0 | 5 | 5 |
| B | 5 | 0 | 5 |
| C | 5 | 5 | 0 |

### Unbalanced matrix&#x20;

A chord diagram with an unbalanced matrix represents data where the sum of the rows does not necessarily equal the sum of the columns. This is common in many real-world scenarios where the flow or relationship between entities is not symmetric.

|   | A  | B  | C  |
| - | -- | -- | -- |
| A | 0  | 30 | 10 |
| B | 20 | 0  | 40 |
| C | 50 | 10 | 0  |
| D | 10 | 30 | 0  |

## Interpretation

* **Thickness of chords**: The width of a chord segment for a category indicates the magnitude of flow from or to that category. If a chord is thicker on the left side where it connects to A, it shows that A is contributing more to another entity than it is receiving.
* **Disparities**: Any visible disparity in the thickness of the chord at either end highlights the imbalance in the relationship.
