public class ComputeEdgeDegrees extends Object implements Program, ProgramDescription
| Modifier and Type | Class and Description |
|---|---|
static class |
ComputeEdgeDegrees.CountEdges
Creates for all records in the group a record of the form (v1, v2, c1, c2), where
v1 is the lexicographically smaller vertex id and the count for the vertex that
was the key contains the number of edges associated with it.
|
static class |
ComputeEdgeDegrees.JoinCountsAndUniquify
Takes the two separate edge entries (v1, v2, c1, 0) and (v1, v2, 0, c2)
and creates an entry (v1, v2, c1, c2).
|
static class |
ComputeEdgeDegrees.ProjectEdge
Duplicates each edge such that: (u,v) becomes (u,v),(v,u)
|
| Constructor and Description |
|---|
ComputeEdgeDegrees() |
| Modifier and Type | Method and Description |
|---|---|
String |
getDescription() |
Plan |
getPlan(String... args)
Assembles the Plan of the triangle enumeration example Pact program.
|
public Plan getPlan(String... args)
public String getDescription()
getDescription in interface ProgramDescriptionCopyright © 2013. All rights reserved.