type
status
date
slug
summary
tags
category
icon
password
1. Get distance matrix from adjacent matrix M using floyd warshall algorithm.
2. Compute N clusters from distance matrix using k-means.
What if we need to specify number of nodes for each cluster?
3. Visualize graph using networkx.
To make edges in the visualized graph scaled to their actual values in the adjacency matrix, we need to use
nx.draw_kamada_kawai to draw the graph.Visualized graph:
- 作者:NotionNext
- 链接:https://tangly1024.com/article/a5c6d495-4fa9-4aad-a501-959046b23146
- 声明:本文采用 CC BY-NC-SA 4.0 许可协议，转载请注明出处。