Skip to content

Commit 0e24303

Browse files
committed
Add LabelPropagationSuite
1 parent 84aa061 commit 0e24303

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed
Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
/*
2+
* Licensed to the Apache Software Foundation (ASF) under one or more
3+
* contributor license agreements. See the NOTICE file distributed with
4+
* this work for additional information regarding copyright ownership.
5+
* The ASF licenses this file to You under the Apache License, Version 2.0
6+
* (the "License"); you may not use this file except in compliance with
7+
* the License. You may obtain a copy of the License at
8+
*
9+
* http://www.apache.org/licenses/LICENSE-2.0
10+
*
11+
* Unless required by applicable law or agreed to in writing, software
12+
* distributed under the License is distributed on an "AS IS" BASIS,
13+
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14+
* See the License for the specific language governing permissions and
15+
* limitations under the License.
16+
*/
17+
18+
package org.apache.spark.graphx.lib
19+
20+
import org.scalatest.FunSuite
21+
22+
import org.apache.spark.graphx._
23+
24+
class LabelPropagationSuite extends FunSuite with LocalSparkContext {
25+
test("Label Propagation") {
26+
withSpark { sc =>
27+
// Construct a graph with two cliques connected by a single edge
28+
val n = 5
29+
val clique1 = for (u <- 0L until n; v <- 0L until n) yield Edge(u, v, 1)
30+
val clique2 = for (u <- 0L to n; v <- 0L to n) yield Edge(u + n, v + n, 1)
31+
val twoCliques = sc.parallelize(clique1 ++ clique2 :+ Edge(0L, n, 1))
32+
val graph = Graph.fromEdges(twoCliques, 1)
33+
// Run label propagation
34+
val labels = LabelPropagation.run(graph, n * 4).cache()
35+
36+
// All vertices within a clique should have the same label
37+
val clique1Labels = labels.vertices.filter(_._1 < n).map(_._2).collect.toArray
38+
assert(clique1Labels.forall(_ == clique1Labels(0)))
39+
val clique2Labels = labels.vertices.filter(_._1 >= n).map(_._2).collect.toArray
40+
assert(clique2Labels.forall(_ == clique2Labels(0)))
41+
// The two cliques should have different labels
42+
assert(clique1Labels(0) != clique2Labels(0))
43+
}
44+
}
45+
}

0 commit comments

Comments
 (0)