From: John S. <js...@gm...> - 2015-07-12 21:22:13
|
Isn't there one already? http://www.boost.org/doc/libs/1_58_0/libs/graph/doc/vf2_sub_graph_iso.html On Sun, Jul 12, 2015 at 2:21 PM, Rushang Karia <rus...@ho...> wrote: > Thanks Fabian!! > > Are you going to contributing a C++ port in Boost as well? > > ------------------------------ > Date: Sun, 12 Jul 2015 14:19:00 -0700 > From: js...@gm... > To: jgr...@li... > CC: fab...@un... > Subject: [jgrapht-users] ismorphism > > > Hey folks, > > Fabian Späh and his colleagues at the University of Constance have > contributed an implementation of the VF2 graph isomorphism and subgraph > isomorphism matching algorithm. > > http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1323804 > > I've merged it into trunk. I've also deleted the old isomorphism > implementation from the experimental package. Although the world still > waits in breathless anticipation to learn whether there exists a guaranteed > polynomial-time solution for isomorphism over arbitrary graphs, the VF2 > algorithm should beat the old brute-force implementation in just about any > case you can think of. > > Thanks Fabian! > > JVS > > > > ------------------------------------------------------------------------------ > Don't Limit Your Business. Reach for the Cloud. GigeNET's Cloud Solutions > provide you with the tools and support that you need to offload your IT > needs and focus on growing your business. Configured For All Businesses. > Start Your Cloud Today. https://www.gigenetcloud.com/ > _______________________________________________ jgrapht-users mailing list > jgr...@li... > https://lists.sourceforge.net/lists/listinfo/jgrapht-users > |