We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
当前进展:
算法需要进行的优化:
当前代码工作的测试及相应结果:
输入:
测试使用的图为 Barbell-Graph (1,1), 其对应邻接矩阵为:[[0,1,INF],[1,0,1],[INF,1,0]]
期望输出(3x3x3 的结构相似度矩阵 structSimi, 显然 structSimi[k][i][j] = fk(Nodei,Nodej))
[ [[0,1,0],[1,0,1],[0,1,0]], [[0,3,0],[3,0,3],[0,3,0]], [[0,NaN,0],[NaN,NaN,NaN],[0,NaN,NaN]] ]
实际输出:(与手算验证结果一致)
java:
scala:
遇到的问题:
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Angel项目第三周&第四周进展
当前进展:
算法需要进行的优化:
当前代码工作的测试及相应结果:
输入:
期望输出(3x3x3 的结构相似度矩阵 structSimi, 显然 structSimi[k][i][j] = fk(Nodei,Nodej))
[
[[0,1,0],[1,0,1],[0,1,0]],
[[0,3,0],[3,0,3],[0,3,0]],
[[0,NaN,0],[NaN,NaN,NaN],[0,NaN,NaN]]
]
实际输出:(与手算验证结果一致)
java:
scala:
遇到的问题:
The text was updated successfully, but these errors were encountered: