Package eu.stratosphere.example.java.record.triangles

Class Summary

Class	Description
ComputeEdgeDegrees
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.
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).
ComputeEdgeDegrees.ProjectEdge	Duplicates each edge such that: (u,v) becomes (u,v),(v,u)
EnumTrianglesOnEdgesWithDegrees	An implementation of the triangle enumeration, which expects its input to encode the degrees of the vertices.
EnumTrianglesOnEdgesWithDegrees.BuildTriads
EnumTrianglesOnEdgesWithDegrees.CloseTriads
EnumTrianglesOnEdgesWithDegrees.ProjectOutCounts
EnumTrianglesOnEdgesWithDegrees.ProjectToLowerDegreeVertex
EnumTrianglesRdfFoaf	Implementation of the triangle enumeration example Pact program.
EnumTrianglesRdfFoaf.BuildTriads	Builds triads (open triangle) from all two edges that share a vertex.
EnumTrianglesRdfFoaf.CloseTriads	Matches all missing edges with existing edges from input.
EnumTrianglesRdfFoaf.EdgeInFormat	Reads RDF triples and filters on the foaf:knows RDF predicate.
EnumTrianglesWithDegrees	An implementation of the triangle enumeration, which includes the pre-processing step to compute the degrees of the vertices and to select the lower-degree vertex for the enumeration of open triads.