Yes it is me again, this time in data structures, we're doing computer graphs. The homework was released last week Friday, and I am having troubles as to how to do it.
I know the concept of it is to basically map out the graphs from 2 seperate files and to backtrack them and at the same time compare the similarities. But I cannot think of any efficient algorithms for this scenario (especially ones with a large number of nodes). I dont entirely understand the ISOMORPHISM concept, as to what constitutes a match.
Another minor question would be how to make the executable accept commands from the command line:
Match gmfile gdfile p|b , where Match is the .exe
I think it has something to do with the default argument of argc[] in main() {}
Heres the HMK link.
I know the concept of it is to basically map out the graphs from 2 seperate files and to backtrack them and at the same time compare the similarities. But I cannot think of any efficient algorithms for this scenario (especially ones with a large number of nodes). I dont entirely understand the ISOMORPHISM concept, as to what constitutes a match.
Another minor question would be how to make the executable accept commands from the command line:
Match gmfile gdfile p|b , where Match is the .exe
I think it has something to do with the default argument of argc[] in main() {}
Heres the HMK link.
