Optimal Order of Adjacency Matrix Visualization
This visualization presents a network as an adjacency matrix, where rows and columns represent nodes and colored cells indicate connections between them. The matrix can be reordered by selecting an option—Name, Group, or leafOrder—to reveal different structural patterns in the data. The visualization uses D3.js (v6) with SVG rendering and animation, leveraging the `reorder` library's optimal leaf ordering algorithm with Manhattan distance to compute an improved node sequence. The underlying dataset is loaded from a TSV file containing network edges, and node groups are derived from link counts.