1. 20 9月, 2017 6 次提交
  2. 19 9月, 2017 10 次提交
  3. 18 9月, 2017 4 次提交
  4. 16 9月, 2017 4 次提交
  5. 15 9月, 2017 2 次提交
    • G
      [FLINK-7199] [gelly] Graph simplification does not set parallelism · 2ac09c08
      Greg Hogan 提交于
      The Simplify parameter should accept and set the parallelism when
      calling the Simplify algorithms.
      
      The LocalClusteringCoefficient "count triangles" reduce now uses the
      assigned ("little") parallelism as this computation is proportional to
      the number of vertices (the combine computation is proportional to the
      potentially much larger number of triangles).
      
      The ignored CombineHint on the HITS all-reduces have been removed.
      
      This closes #4346
      2ac09c08
    • G
      [FLINK-7273] [gelly] Gelly tests with empty graphs · 9437a0ff
      Greg Hogan 提交于
      There exist some tests with empty graphs but the `EmptyGraph` in
      `AsmTestBase` contained vertices but no edges. Add a new `EmptyGraph`
      without vertices and test both empty graphs for each algorithm.
      
      EmptyGraph now generates the proper TypeInformation (for Edge<> not
      Tuple3) which had prevented adding edges due to a union incompatibility.
      
      GraphGeneratorUtils#vertexSet now uses a hash-combine for distinct.
      
      `PageRank` optionally includes zero-degree vertices in the results
      (at a performance cost).
      
      This closes #4405
      9437a0ff
  6. 14 9月, 2017 2 次提交
  7. 07 9月, 2017 6 次提交
  8. 06 9月, 2017 3 次提交
  9. 05 9月, 2017 3 次提交