User Ratings

3.0 out of 5 stars
★★★★★
★★★★
★★★
★★
★
0
0
1
0
0
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 3 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 5 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 4 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 1 / 5
Rate This Project
Login To Rate This Project

User Reviews

Filter Reviews:
All
  • synchman Posted 2018-05-13
    I was able to get this algorithm to run by adding a Main that instantiates SampleCall and passes in run arguments, then saves the results to file. I produced an output graph edit distance file, which I posted to the Wiki. I have run it on my actual graph data, and I'm off to cluster the resulting Graph Edit Distance matrix using 'R'. So far, so good!