Skip to content

Commit 7388705

Browse files
committed
Remove unnecessary ClassTag for VD parameters
1 parent a704e5f commit 7388705

File tree

2 files changed

+2
-2
lines changed

2 files changed

+2
-2
lines changed

graphx/src/main/scala/org/apache/spark/graphx/lib/LabelPropagation.scala

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@ object LabelPropagation {
4141
*
4242
* @return a graph with vertex attributes containing the label of community affiliation
4343
*/
44-
def run[VD: ClassTag, ED: ClassTag](graph: Graph[VD, ED], maxSteps: Int): Graph[VertexId, ED] = {
44+
def run[VD, ED: ClassTag](graph: Graph[VD, ED], maxSteps: Int): Graph[VertexId, ED] = {
4545
val lpaGraph = graph.mapVertices { case (vid, _) => vid }
4646
def sendMessage(e: EdgeTriplet[VertexId, ED]) = {
4747
Iterator((e.srcId, Map(e.dstAttr -> 1L)), (e.dstId, Map(e.srcAttr -> 1L)))

graphx/src/main/scala/org/apache/spark/graphx/lib/ShortestPaths.scala

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -49,7 +49,7 @@ object ShortestPaths {
4949
* @return a graph where each vertex attribute is a map containing the shortest-path distance to
5050
* each reachable landmark vertex.
5151
*/
52-
def run[VD: ClassTag, ED: ClassTag](graph: Graph[VD, ED], landmarks: Seq[VertexId]): Graph[SPMap, ED] = {
52+
def run[VD, ED: ClassTag](graph: Graph[VD, ED], landmarks: Seq[VertexId]): Graph[SPMap, ED] = {
5353
val spGraph = graph.mapVertices { (vid, attr) =>
5454
if (landmarks.contains(vid)) makeMap(vid -> 0) else makeMap()
5555
}

0 commit comments

Comments
 (0)