{"package":"VertexSimilarity","ecosystem":"cran","latest_version":"0.1","description":"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>.","license":"GPL-2","license_risk":"strong_copyleft","commercial_use_notes":"GPL-2.0: derivative works must release source under GPL; static linking forces disclosure.","homepage":"https://cran.r-project.org/package=VertexSimilarity","repository":"https://CRAN.R-project.org/package=VertexSimilarity","downloads_weekly":59,"health":{"score":42,"risk":"high","breakdown":{"maintenance":0,"popularity":0,"security":25,"maturity":15,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"0.1","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2016-01-24 15:38:21","last_published":"2016-01-24T21:37:10+00:00","dependencies_count":1,"dependencies":["igraph"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"safe_to_use","issues":[],"use_version":"0.1","version_hint":null,"summary":"VertexSimilarity@0.1 is safe to use (health: 42/100)"},"version_scoped":null,"requested_version":null,"_cache":"hit","_response_ms":0,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}