dfs_search question

classic Classic list List threaded Threaded
4 messages Options
Tom
Reply | Threaded
Open this post in threaded view
|

dfs_search question

Tom
Hi,

I trying to use dfs_search, and after digging through the sources, it appears that only dfs_search accepting a start vertex is exposed by the library.  However, the BGL also has an overload for depth_first_search which doesn't need a vertex and traverses *all* vertices.  (In addition to the two overloads, there is also a separate interface depth_first_visit(), which does exactly what "dfs_search" does.)

Any chance of exposing the versions of [db]fs_search which don't need a start vertex, please?  

Many thanks,

Tom
Reply | Threaded
Open this post in threaded view
|

Re: dfs_search question

Tiago Peixoto
Administrator
On 17.02.2017 05:30, Tom wrote:

> Hi,
>
> I trying to use dfs_search, and after digging through the sources, it
> appears that only dfs_search accepting a start vertex is exposed by the
> library.  However, the BGL also has an overload for depth_first_search which
> doesn't need a vertex and traverses *all* vertices.  (In addition to the two
> overloads, there is also a separate interface depth_first_visit(), which
> does exactly what "dfs_search" does.)
>
> Any chance of exposing the versions of [db]fs_search which don't need a
> start vertex, please?  
Yes, just open an issue in the website, and I will implement it.

Best,
Tiago

--
Tiago de Paula Peixoto <[hidden email]>


_______________________________________________
graph-tool mailing list
[hidden email]
https://lists.skewed.de/mailman/listinfo/graph-tool

signature.asc (849 bytes) Download Attachment
--
Tiago de Paula Peixoto <tiago@skewed.de>
Reply | Threaded
Open this post in threaded view
|

Re: dfs_search question

Tiago Peixoto
Administrator
On 17.02.2017 09:02, Tiago de Paula Peixoto wrote:

> On 17.02.2017 05:30, Tom wrote:
>> Hi,
>>
>> I trying to use dfs_search, and after digging through the sources, it
>> appears that only dfs_search accepting a start vertex is exposed by the
>> library.  However, the BGL also has an overload for depth_first_search which
>> doesn't need a vertex and traverses *all* vertices.  (In addition to the two
>> overloads, there is also a separate interface depth_first_visit(), which
>> does exactly what "dfs_search" does.)
>>
>> Any chance of exposing the versions of [db]fs_search which don't need a
>> start vertex, please?  
>
> Yes, just open an issue in the website, and I will implement it.
FYI, I just committed this to git. No need to open an issue.

--
Tiago de Paula Peixoto <[hidden email]>


_______________________________________________
graph-tool mailing list
[hidden email]
https://lists.skewed.de/mailman/listinfo/graph-tool

signature.asc (849 bytes) Download Attachment
--
Tiago de Paula Peixoto <tiago@skewed.de>
Tom
Reply | Threaded
Open this post in threaded view
|

Re: dfs_search question

Tom
Dear Tiago,

Wow, that was fast!  Thank you.  I will download and build later today.
Best wishes,

Tom