Skip to content

Add a function that can build an EdgePartition faster. #740

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -204,7 +204,7 @@ class EdgePartition[
if (size > 0) {
builder.add(currSrcId, currDstId, currAttr)
}
builder.toEdgePartition.withVertices(vertices).withActiveSet(activeSet)
builder.toEdgePartitionWithoutSort.withVertices(vertices).withActiveSet(activeSet)
}

/**
Expand Down Expand Up @@ -238,7 +238,7 @@ class EdgePartition[
}
i += 1
}
builder.toEdgePartition.withVertices(vertices).withActiveSet(activeSet)
builder.toEdgePartitionWithoutSort.withVertices(vertices).withActiveSet(activeSet)
}

/**
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -69,4 +69,36 @@ class EdgePartitionBuilder[@specialized(Long, Int, Double) ED: ClassTag, VD: Cla

new EdgePartition(srcIds, dstIds, data, index, vertices)
}

/** If every edge add to edges in Edge.lexicographicOrdering, we don't need to sort edgeArray. */
def toEdgePartitionWithoutSort: EdgePartition[ED, VD] = {
val edgeArray = edges.trim().array
val srcIds = edgeArray.map(edge => edge.srcId)
val dstIds = edgeArray.map(edge => edge.dstId)
val data = edgeArray.map(edge => edge.attr)
val index = new PrimitiveKeyOpenHashMap[VertexId, Int]

val edgeNum = edgeArray.length
if (edgeNum > 0) {
index.update(srcIds(0), 0)
var currSrcId: VertexId = srcIds(0)
var i = 0
while (i < edgeNum) {
if (srcIds(i) != currSrcId) {
currSrcId = srcIds(i)
index.update(currSrcId, i)
}
i += 1
}
}

// Create and populate a VertexPartition with vids from the edges, but no attributes
val vidsIter = srcIds.iterator ++ dstIds.iterator
val vertexIds = new OpenHashSet[VertexId]
vidsIter.foreach(vid => vertexIds.add(vid))
val vertices = new VertexPartition(
vertexIds, new Array[VD](vertexIds.capacity), vertexIds.getBitSet)

new EdgePartition(srcIds, dstIds, data, index, vertices)
}
}