本代码实现hits算法的迭代计算和归一化,仅供参考使用,若需一键下载请移步java实现的hits算法
Main3.java:
package hits;
/**
* Created by bingo on 16-11-15.
*/
public class Main3 {
public static final int VERTERSNUM=4;
//设定输入几个节点,现在默认为4个,便于对顶点进行赋初值(确定初始中心值和权威值比重),若要增加节点数量请务必在此先更改.
public static void main(String[] args) {
DirectedGraph theGraph = new DirectedGraph();
theGraph.addVertex("A");//4个节点
theGraph.addVertex("B");
theGraph.addVertex("C");
theGraph.addVertex("D");
//添加有向边
theGraph.addEdge(0, 1);
theGraph.addEdge(0, 3);
theGraph.addEdge(1, 3);
theGraph.addEdge(2, 0);
theGraph.addEdge(2, 1);
theGraph.addEdge(3, 2);
System.out.println("visit:");
theGraph.visithits(0.01);
//进行HITS算法,迭代计算中枢值和权威值,
// 收敛条件为0.01,对每个节点的最近两次中心值比重和权威值比重进行分别比较,
// 若所有节点的最近两次中心值比重或权威值比重相差都小0.01则结束迭代
}
}
package hits;
import java.util.ArrayList;
/**
* Created by bingo on 16-11-15.
*/
public class DirectedGraph {
private final int HUB=1;//中心值
private final int AUTH=0;//权威值
private final int MAX_VERETS=20;//最大顶点数
private Vertex3 vertexList[];// 储存顶点的图
private int adjMat[][];//邻接矩阵
private int nVerts;