[boost] [BGL] subgraph isomorphism algorithm

For those of you interested in subgraph isomorphism, I put a raw version of Ullmann's algorithm at http://groups.yahoo.com/group/boost/files/ullmann.hpp It uses BGL's interface. Regards, -- vladimir josef sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-78005-0 fa

[boost] Re: [BGL] Preconditioned color maps?

t; > > g-h-i > >> > > > > >> > > > Starting vertex is 'c' and I want to eliminate the "d-e-f" branch, > >> > > > so the DFS finds "c-b-a" and "c-g-h-i". > >> > >> AFAICS, 'd'

[boost] Re: (from: [Boost-Users]) [BGL] Preconditioned color maps?

constrained_undirected_dfs which is a carbon copy of the undirected_dfs > algorithm, except that the last loop which goes through any whites left > has been removed. > > I don't know if it's a thing to consider incorporating into BGL (it > could also be accomplished by

[boost] Re: Draft dimensions and units library uploaded

Hello Eric, Regarding your previous posting, the conflict with the standard (on gcc) can be solved encapsulating your function inside a nameless namespace, or using an _aux_ namespace and later inject it into your namespace via 'using'. HTW, regards, -- vladimir josef sykora mor

[boost] Re: Looking for units library

<< m << '\t'; // output: 1000 m Regards, -- vladimir josef sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-78005-0 fax ++49-89-78005-555 [EMAIL PROTECTED] http://www.morphochem.de "Alexander Dz" <[EMAIL PROTECTED]> wrote in me

[boost] Re: Re: Re: BGL bfs and dfs

ase correct me if I'm wrong. > > I don't know what this syntax does now :-) I mean that this or similiar syntax > should be used to find the type suitable for external property map. > > > > I think that external property maps should be improved, like I describe > >

[boost] Re: Re: BGL bfs and dfs

ndirected. For directed graphs, just get rid of the canonization. Then (v1,v2) != (v2,v1). The strict weak ordering is preserved. > > I think that external property maps should be improved, like I describe above > or it some other way. It hits me quite often. I guess you're refering

[boost] Re: BGL bfs and dfs

> > The point is that I have my own internal properties for vertices and edges, > > and I had to construct new color maps to pass to the algorithms (providing > > get() and put()). Does this mean a that shallow copy is a requirement for > > the concept of property map? > > The docs state that in qu

[boost] Re: BGL bfs and dfs

Hello vladimir, "Vladimir Prus" <[EMAIL PROTECTED]> wrote in message b2aipc$6us$[EMAIL PROTECTED]">news:b2aipc$6us$[EMAIL PROTECTED]... > Hi vladimir, > > DF visit and undirected-DFV implementations (depth_first_visit_impl > > and undir_dfv_impl) functions receive ColorMaps by value, consequently

[boost] MPL's gcc ADL fixes

Hello Aleksey, Encapsulating algorithms with a _new_ namespace, and later injecting it into the ::mpl via 'using', solves fine gcc's ADL conflicts. Could you apply BOOST_MPL_AUX_AGLORITHM_NAMESPACE patch to other algorithms? Thanks, ^ ^ -- vladimir josef sy

[boost] BGL bfs and dfs

not receive visitors by reference? Anyone has implemented Ullman's algorithm for subgraph isomorphism with BGL's interface? Any experience with maximal common subgraph and/or maximal overlap set? -- vladimir josef sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-7

[boost] Re: mpl::copy_backward conflicts

"David Abrahams" <[EMAIL PROTECTED]> wrote in message [EMAIL PROTECTED]">news:[EMAIL PROTECTED]... > Aleksey Gurtovoy <[EMAIL PROTECTED]> writes: > > > Meanwhile, I am not sure what one can do about it besides switching to > > another standard library implementation (e.g. STLPort). Well, I guess I

[boost] mpl::copy_backward conflicts

backward is found via ADL, I consider this IMHO a stringent restriction to the use of mpl::insert & mpl::erase. Please correct me if I'm wrong. -- vladimir josef sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-78005-0 fax ++49-89-78005-555 [EMAIL PROTE

[boost] Re: mpl transform

"David Abrahams" <[EMAIL PROTECTED]> wrote in message [EMAIL PROTECTED]">news:[EMAIL PROTECTED]... > Consider applying the fold algorithm to the first sequence, using an > adapted binary operation, something like: > > // * Untested! > > // A dummy iterator that prevents us running off

[boost] boost & Borland C++ Builder 6

Any experiences using boost-libs with Borland Builder 6, specially BGL and MPL? Already performed or anyone attempted some Regression Tests? -- vladimir sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-78005-0 fax ++49-89-78005-555 [EMAIL PROTECTED] http://www.morphochem.d

[boost] mpl transform

ty O(n)? -- vladimir josef sykora morphochem AG gmunder str. 37-37a 81379 muenchen tel. ++49-89-78005-0 fax ++49-89-78005-555 [EMAIL PROTECTED] http://www.morphochem.de ___ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost