91av视频/亚洲h视频/操亚洲美女/外国一级黄色毛片 - 国产三级三级三级三级

  • 大小: 5KB
    文件類型: .java
    金幣: 1
    下載: 0 次
    發布日期: 2021-05-09
  • 語言: Java
  • 標簽: LPA社團??

資源簡介

標簽傳播算法,能快速準確的識別網絡社團,效率高,接近線性,但是對于二分圖會產生震蕩現象

資源截圖

代碼片段和文件信息

package?lpa;
import?java.util.Arrays;

public?class?other?{
static?int?Vertex=7;
static?int[]?Lable_t=new?int[Vertex];//存放各個點的標簽t時刻
static?int[]?Lable_t_1=new?int[Vertex];//存放各個點的標簽t-1時刻
static?int[]?Importance_sorting=new?int[Vertex];//存放各個點的重要度
static?int[]?Vertex_neighbour_lable=new?int[Vertex];//存放鄰居節點的標簽個
static?int[]?Sum_degree=new?int[Vertex];//存放鄰居節點的標簽個
//static?int[][]?Degree_array=new?int[Vertex][2];//暫時沒用
static?int?[][]?Adjmartrix=new?int[Vertex][Vertex];//存放鄰接矩陣
/**********************
?*?對排過序的每個元素進行標簽賦值
?*?把孤立節點排除在外
?*?*************************/
public?static?void?main(String[]?args)?{
int?Iteration=0;
//int?Edge_graph[][]={{12}{14}{13}{23}{24}{34}};
//int?Edge_graph[][]={{12}{14}{23}{36}{45}{56}};
//int?Edge_graph[][]={{12}{14}{23}{36}{56}{45}};
//int?Edge_graph[][]={{12}{13}{23}{34}{46}{45}{65}};
int?Edge_graph[][]={{12}{13}{23}{34}{45}{75}{65}{67}};
//int?Edge_graph[][]={{12}{13}{23}{45}{56}};
//int?Edge_graph[][]={{14}{15}{16}{23}{27}{34}{37}{46}{56}{58}{67}{616}{714}{89}{811}{812}{910}{1011}{1013}{1112}{1116}{1213}{1415}{1418}{1517}{1519}{1520}{1617}{1620}{1621}{1819}{1920}{1921}};
/**********************初始化*************************/
Initing(Edge_graph);
Ininting_Degree_Sorting(Edge_graph);//對重要度進行排序,亦是隨機序列
//Sum_degree_vertex(Edge_graph);
/*****************對每一個節點,返回所有鄰居中某標簽數最多的標簽值*****************/
while(!Arrays.equals(Lable_t_1Lable_t)){
Iteration++;
Lable_Spread();
}
for(int?i=0;i System.out.print(Lable_t[i]+“?“);
}
System.out.print(“\n“);
for(int?i=0;i System.out.print(i+“?“);
}
System.out.print(“\n“);
System.out.println(“Iteration:“+Iteration);
}
/**********************數據初始化*************************/
public?static?void?Initing(int?edge[][]){//
for(int?i=0;i Adjmartrix[edge[i][0]-1][edge[i][1]-1]=1;
Adjmartrix[edge[i][1]-1][edge[i][0]-1]=1;
}
Arrays.fill(Sum_degree0);
for(int?i=0;i Lable_t[i]=i;
Importance_sorting[i]=0;
Lable_t_1[i]=0;
Vertex_neighbour_lable[i]=0;
}
}

/**********************選擇更新策略*************************/
public?static?void?Lable_Spread(){
for(int?i=0;i Lable_t_1[i]=Lable_t[i];
Lable_Update();
//System.out.println(“Lable_Spread:“);
}
/**********************選擇標簽*************************/
public?static?int?Lable_Select(int?v){
int?ve

評論

共有 條評論

相關資源