no code implementations • 22 Jan 2018 • Muhammad Abulaish, Jahiruddin
We have also proposed a MAGDist algorithm, which reads multi-attributed graph stored in CSV files containing the list of vertex vectors and edge vectors, and calculates the distance between each vertex-pair using the proposed weighted distance measure.