fahrbach / faster-graph-embeddings Goto Github PK
View Code? Open in Web Editor NEWFaster graph embeddings via coarsening (ICML 2020)
License: MIT License
Faster graph embeddings via coarsening (ICML 2020)
License: MIT License
Dear author,
Could you please explain these few lines of code in "GreedyRandomContractions" from the file "random-contraction.cc":
// Trying target min degree
if (adj[node].size() > TARGET_DEGREE) return;
Should the "return" command be replaced by "continue;" or something else?
if you "return" this function here, all remained nodes are not processed, but you haven't ranked them by their nodes. How could you guarantee that all remaining nodes are of a degree larger than TARGET_DEGREE, which is 30 as a default parameter in your code.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.