1. RRF Files to Lexcare Database progressive bar done. => it is need to be debuged.

2. SNS service crawling and show.

start network ; one vertex is connected to all other vertices

These vertices are not connected among themselves

most efficient structure

d-centrality : the variation in the degree of vertices divided by the maximum degree variabtion which is possible in a network of same size.

difference : 기준

degree variation / maximum degree variation

군대에서 상황근무서면...

다음날도 일어나 일을 해야한다 오후에 ㅠ.ㅠ

지금이 그러하다.

나는 군대에 있는 것인가 사회에 있는 것인가..

나에게 낙은 그나마 연구실갈때 비어있을 전철의자다 그마저도 없다면 ㅠ.ㅠ

ㅈㅁㅋㅁ

p126 ~

한 네트워 크의 degree centalization이란

The term of "semi" is meaning of ignoring direction.

geodesic : shortest path

degree centrality

variatin : 차이??

closeness centralization = 전체 vertex - 1 / geodesic의 합