erstelle ClosenessCentralityNodeSorter
add package gtna.projects.resilienceMeasure and class NodeSortingTest
implement method isPropertyEqual, class DegreeAsc in ClosenessCentralityNodeSorter
sort() implemented, CC must be calculated
added: BetweennessCentralityNodeSorter
added: EffectiveEccentricityNodeSorter
Try to implement all shortest path
exact closenesscentrality implemnted
try to implement Floyd's Algorithm
Using Floyd's Algorithm to calculate all pairs shortest paths
try to implement betweenness centrality
implemented: import graph from file using gephi toolkit + import test
error fixed in graph import, closeness centrality correcness checked
fix error (doubleValue and intValue) in betweennesscentrality
remove log in algorithms
add egenvector centrality
create a class for all centralities, betweenness and closeness are tested
implement: biconnected component metric, 1. Version: list all biconnected components
implement: get the max biconnected component (according to number of vertices). biconnected components tested
implement: eigenvector centrality (iteration approx. ), but was not tested