Click here to Skip to main content
15,891,704 members
Please Sign up or sign in to vote.
1.00/5 (3 votes)
See more:
i want to source code for to check whether two or more graph is isomorphic graph or not.
Posted

Go, do not pass go, do not collect <insert relevent="" currency="" in="" here=""> 200 to http://boost.org[^]. They have a graph library there that may include the sort of code you're interested in.

Cheers,

Ash
 
Share this answer
 
Here I give a polynomial-time algorithm for this: Proposal: O(N^5) algorithm solving Graph Isomorphism problem (comparison of graphs)[^] .

I would appreciate feedback on whether the algorithm worked well for the graph comparison you need. Here is the original post: http://www.researchgate.net/profile/Sarge_Rogatch/blog/44638_Polynomial-time_algorithm_for_Graph_Isomorphism_problem[^]
 
Share this answer
 
v2

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900