algorithm - Spark GraphX: Independent edge set (matching) -


given graph g: graph[vd, int], how compute maximal weighted independent edge set (matching)? i'm interested in greedy solution edges selected in greatest-weight-first order. i've devised both pregel , iterative message aggregating solution work, wildly inefficient.


Comments

Popular posts from this blog

javascript - Training Neural Network to play flappy bird with genetic algorithm - Why can't it learn? -

service - Android MediaPlayer calls onCompletion before it already finished -

javascript - Create a stacked percentage column -