VertexSimilarity
Creates Vertex Similarity Matrix for an Undirected Graph
Creates Vertex Similarity matrix of an undirected graph based on the method stated by E. A. Leicht, Petter Holme, AND M. E. J. Newman in their paper <DOI:10.1103/PhysRevE.73.026120>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1 |
rolling linux/jammy R-4.5 | VertexSimilarity_0.1.tar.gz |
8.8 KiB |
0.1 |
rolling linux/noble R-4.5 | VertexSimilarity_0.1.tar.gz |
8.7 KiB |
0.1 |
rolling source/ R- | VertexSimilarity_0.1.tar.gz |
1.4 KiB |
0.1 |
latest linux/jammy R-4.5 | VertexSimilarity_0.1.tar.gz |
8.8 KiB |
0.1 |
latest linux/noble R-4.5 | VertexSimilarity_0.1.tar.gz |
8.7 KiB |
0.1 |
latest source/ R- | VertexSimilarity_0.1.tar.gz |
1.4 KiB |
0.1 |
2026-04-26 source/ R- | VertexSimilarity_0.1.tar.gz |
1.4 KiB |
0.1 |
2026-04-23 source/ R- | VertexSimilarity_0.1.tar.gz |
1.4 KiB |
0.1 |
2026-04-09 windows/windows R-4.5 | VertexSimilarity_0.1.zip |
12.2 KiB |
0.1 |
2025-04-20 source/ R- | VertexSimilarity_0.1.tar.gz |
1.4 KiB |