where target_list has type: boost::python::list
f
2015-04-18 0:02 GMT+02:00 François Kawala <francois.kaw...@gmail.com>:
> Should this convertion work ?
>
> std::unordered_set<std::size_t> tgt = unordered_set
> (std::initializer_list<size_t>
> boost::python::stl_input_iterator<size_t>(target_list))
>
> If so, is that efficient ?
>
> Best,
> F.
>
>
>
> 2015-04-15 9:03 GMT+02:00 Tiago Peixoto [via Main discussion list for the
> graph-tool project] <ml-node+s982480n4026074...@n3.nabble.com>:
>
>> On 15.04.2015 01:14, François Kawala wrote:
>> > About your comment on line 196 (which probably also applies to lines
>> > 238 and 274), what is proper way to receive a set from python ?
>>
>> You have to expose the class to Python using boost::python:
>>
>>
>> http://www.boost.org/doc/libs/1_57_0/libs/python/doc/tutorial/doc/html/python/exposing.html
>>
>> However, in this case a much more straightforward approach is to receive
>> any python iterable (a generic boost::python::object in C++), and
>> convert it to an unordered_set<> in C++, before the algorithm is run.
>>
>> Best,
>> Tiago
>>
>> --
>> Tiago de Paula Peixoto <[hidden email]
>> <http:///user/SendEmail.jtp?type=node&node=4026074&i=0>>
>>
>>
>> _______________________________________________
>> graph-tool mailing list
>> [hidden email] <http:///user/SendEmail.jtp?type=node&node=4026074&i=1>
>> http://lists.skewed.de/mailman/listinfo/graph-tool
>>
>> *signature.asc* (836 bytes) Download Attachment
>> <http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/attachment/4026074/0/signature.asc>
>> --
>> Tiago de Paula Peixoto <ti...@skewed.de>
>>
>>
>> ------------------------------
>> If you reply to this email, your message will be added to the
>> discussion below:
>>
>> http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Mutliple-destination-Shortest-Path-Dijkstra-tp4026059p4026074.html
>> To start a new topic under Main discussion list for the graph-tool
>> project, email ml-node+s982480n2141189...@n3.nabble.com
>> To unsubscribe from Main discussion list for the graph-tool project, click
>> here
>> <http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/template/NamlServlet.jtp?macro=unsubscribe_by_code&node=2141189&code=ZnJhbmNvaXMua2F3YWxhQGdtYWlsLmNvbXwyMTQxMTg5fDIxMTQ0MDk4Nzk=>
>> .
>> NAML
>> <http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/template/NamlServlet.jtp?macro=macro_viewer&id=instant_html%21nabble%3Aemail.naml&base=nabble.naml.namespaces.BasicNamespace-nabble.view.web.template.NabbleNamespace-nabble.view.web.template.NodeNamespace&breadcrumbs=notify_subscribers%21nabble%3Aemail.naml-instant_emails%21nabble%3Aemail.naml-send_instant_email%21nabble%3Aemail.naml>
>>
>
>
>
> --
> François Kawala
>
--
François Kawala
--
View this message in context:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Mutliple-destination-Shortest-Path-Dijkstra-tp4026059p4026083.html
Sent from the Main discussion list for the graph-tool project mailing list
archive at Nabble.com.
_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool
