Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
doujutun3207
flink
提交
a355df6e
F
flink
项目概览
doujutun3207
/
flink
与 Fork 源项目一致
从无法访问的项目Fork
通知
24
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
flink
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
a355df6e
编写于
12月 05, 2017
作者:
G
Greg Hogan
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[FLINK-5506] [gelly] Fix CommunityDetection NullPointerException
Double.MIN_VALUE != min(double) This closes #5126
上级
1a98e327
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
117 addition
and
1 deletion
+117
-1
flink-libraries/flink-gelly/src/main/java/org/apache/flink/graph/library/CommunityDetection.java
...va/org/apache/flink/graph/library/CommunityDetection.java
+1
-1
flink-libraries/flink-gelly/src/test/java/org/apache/flink/graph/library/CommunityDetectionTest.java
...rg/apache/flink/graph/library/CommunityDetectionTest.java
+116
-0
未找到文件。
flink-libraries/flink-gelly/src/main/java/org/apache/flink/graph/library/CommunityDetection.java
浏览文件 @
a355df6e
...
...
@@ -144,7 +144,7 @@ public class CommunityDetection<K> implements GraphAlgorithm<K, Long, Double, Gr
if
(
receivedLabelsWithScores
.
size
()
>
0
)
{
// find the label with the highest score from the ones received
double
maxScore
=
Double
.
MIN
_VALUE
;
double
maxScore
=
-
Double
.
MAX
_VALUE
;
long
maxScoreLabel
=
vertex
.
getValue
().
f0
;
for
(
long
curLabel
:
receivedLabelsWithScores
.
keySet
())
{
...
...
flink-libraries/flink-gelly/src/test/java/org/apache/flink/graph/library/CommunityDetectionTest.java
0 → 100644
浏览文件 @
a355df6e
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package
org.apache.flink.graph.library
;
import
org.apache.flink.api.common.typeinfo.TypeHint
;
import
org.apache.flink.graph.Edge
;
import
org.apache.flink.graph.Graph
;
import
org.apache.flink.graph.Vertex
;
import
org.apache.flink.graph.asm.AsmTestBase
;
import
org.apache.flink.graph.asm.dataset.ChecksumHashCode
;
import
org.apache.flink.graph.asm.dataset.ChecksumHashCode.Checksum
;
import
org.apache.flink.graph.generator.SingletonEdgeGraph
;
import
org.apache.flink.test.util.TestBaseUtils
;
import
org.apache.flink.types.IntValue
;
import
org.apache.flink.types.LongValue
;
import
org.junit.Test
;
import
static
org
.
junit
.
Assert
.
assertEquals
;
/**
* Tests for {@link CommunityDetection}.
*/
public
class
CommunityDetectionTest
extends
AsmTestBase
{
@Test
public
void
testWithSimpleGraph
()
throws
Exception
{
Graph
<
IntValue
,
Long
,
Double
>
result
=
undirectedSimpleGraph
.
mapVertices
(
v
->
(
long
)
v
.
getId
().
getValue
(),
new
TypeHint
<
Vertex
<
IntValue
,
Long
>>(){}.
getTypeInfo
())
.
mapEdges
(
e
->
(
double
)
e
.
getTarget
().
getValue
()
+
e
.
getSource
().
getValue
(),
new
TypeHint
<
Edge
<
IntValue
,
Double
>>(){}.
getTypeInfo
())
.
run
(
new
CommunityDetection
<>(
10
,
0.5
));
String
expectedResult
=
"(0,3)\n"
+
"(1,5)\n"
+
"(2,5)\n"
+
"(3,3)\n"
+
"(4,5)\n"
+
"(5,5)\n"
;
TestBaseUtils
.
compareResultAsText
(
result
.
getVertices
().
collect
(),
expectedResult
);
}
@Test
public
void
testWithSingletonEdgeGraph
()
throws
Exception
{
Graph
<
LongValue
,
Long
,
Double
>
result
=
new
SingletonEdgeGraph
(
env
,
1
)
.
generate
()
.
mapVertices
(
v
->
v
.
getId
().
getValue
(),
new
TypeHint
<
Vertex
<
LongValue
,
Long
>>(){}.
getTypeInfo
())
.
mapEdges
(
e
->
1.0
,
new
TypeHint
<
Edge
<
LongValue
,
Double
>>(){}.
getTypeInfo
())
.
run
(
new
CommunityDetection
<>(
10
,
0.5
));
String
expectedResult
=
"(0,0)\n"
+
"(1,1)\n"
;
TestBaseUtils
.
compareResultAsText
(
result
.
getVertices
().
collect
(),
expectedResult
);
}
@Test
public
void
testWithEmptyGraphWithVertices
()
throws
Exception
{
emptyGraphWithVertices
.
mapVertices
(
v
->
0L
,
new
TypeHint
<
Vertex
<
LongValue
,
Long
>>(){}.
getTypeInfo
())
.
mapEdges
(
e
->
0.0
,
new
TypeHint
<
Edge
<
LongValue
,
Double
>>(){}.
getTypeInfo
())
.
run
(
new
CommunityDetection
<>(
10
,
0.5
));
}
@Test
public
void
testWithEmptyGraphWithoutVertices
()
throws
Exception
{
emptyGraphWithoutVertices
.
mapVertices
(
v
->
0L
,
new
TypeHint
<
Vertex
<
LongValue
,
Long
>>(){}.
getTypeInfo
())
.
mapEdges
(
e
->
0.0
,
new
TypeHint
<
Edge
<
LongValue
,
Double
>>(){}.
getTypeInfo
())
.
run
(
new
CommunityDetection
<>(
10
,
0.5
));
}
@Test
public
void
testWithRMatGraph
()
throws
Exception
{
Graph
<
LongValue
,
Long
,
Double
>
result
=
undirectedRMatGraph
(
8
,
4
)
.
mapVertices
(
v
->
v
.
getId
().
getValue
(),
new
TypeHint
<
Vertex
<
LongValue
,
Long
>>(){}.
getTypeInfo
())
.
mapEdges
(
e
->
(
double
)
e
.
getTarget
().
getValue
()
-
e
.
getSource
().
getValue
(),
new
TypeHint
<
Edge
<
LongValue
,
Double
>>(){}.
getTypeInfo
())
.
run
(
new
CommunityDetection
<>(
10
,
0.5
));
Checksum
checksum
=
new
ChecksumHashCode
<
Vertex
<
LongValue
,
Long
>>()
.
run
(
result
.
getVertices
())
.
execute
();
assertEquals
(
184
,
checksum
.
getCount
());
assertEquals
(
0x00000000000cdc96
L
,
checksum
.
getChecksum
());
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录