issues
search
LijunChang
/
Graph_Edit_Distance
Exact graph edit distance (GED) computation and verification
MIT License
53
stars
14
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Enter the specific meaning of the numbers in the document
#14
mswang11
opened
1 month ago
0
Adding pairwise GED calculation and simple optimizations
#13
amszymanska
opened
2 months ago
0
Get the edit path
#12
whj0401
opened
1 year ago
0
Is it possible to verfication mutiple distance without extra overhead?
#11
weathon
opened
2 years ago
0
Interface
#10
weathon
closed
2 years ago
1
Can I just get the lower/upper bounds instead of the real distance?
#9
weathon
closed
2 years ago
1
Is there a way to load all the graphes in RAM, then call a funcition to get the ged for 2 items?
#8
weathon
closed
2 years ago
0
Am I making my file wrong or my understanding of GED is wrong?
#7
weathon
closed
2 years ago
2
Create LICENSE.md
#6
LijunChang
closed
2 years ago
0
Open Source License?
#5
weathon
closed
2 years ago
1
How to change the edit cost?
#4
jiaxilv
opened
2 years ago
3
WA in load graph! (Using integer values only)
#3
madil27
opened
3 years ago
5
WA% in load graph!
#2
davide1995
closed
4 years ago
2
Original Code?
#1
mrmechko
closed
6 years ago
1