graph, edge_weights = hg.make_graph_from_points(X, 'delaunay')
return tuple((graph, edge_weights))
def knnGraph(X):
graph, edge_weights = hg.make_graph_from_points(X, 'knn', n_neighbor=3)
return tuple((graph, edge_weights))
def MST(G):
return hg.minimum_spanning_tree(G[0], G[1])
def SLINK(G):
return hg.binary_partition_tree_single_linkage(G[0], G[1])
def CLINK(G):
return hg.binary_partition_tree_complete_linkage(G[0], G[1])
if __name__ == "__main__":
import sys
filePath = "data.csv"
if len(sys.argv) > 1:
filePath = sys.argv[1]
hg1 = Benchmark("higra-dt-mst", loadPoints, delaunayGraph, MST)
hg1.run(filePath)
hg2 = Benchmark("higra-3nn-clink", loadPoints, knnGraph, CLINK)
hg2.run(filePath)
hg1.info()
hg2.info()
return geograph.loadFromSnap("tmp.snap", True, True)
def cleanUp():
import os
os.remove("tmp.snap")
if __name__ == "__main__":
import sys
filePath = "data.csv"
if len(sys.argv) > 1:
filePath = sys.argv[1]
gg1 = Benchmark("geograph-dt-mst", gt.loadPoints, delaunayGraph, gt.MST)
gg1.run(filePath)
gg2 = Benchmark("geograph-3nn-clink", gt.loadPoints, knnGraph, gt.CLINK)
gg2.run(filePath)
gg3 = Benchmark("geograph-3nn-filtered-cc", gt.loadPoints, filteredKnnGraph, gt.CC)
gg3.run(filePath)
gg4 = Benchmark("geograph-gabriel-sssp", gt.loadPoints, gabrielGraph, gt.SSSP)
gg4.run(filePath)
gg1.info()
gg2.info()
gg3.info()
gg4.info()
cleanUp()
