Regular Expressions in Graph/Subgraph Isomorphism
Hi, I have a question/request: I want to be able to match certain vertex/edge labels using a regular expression notation (i.e. if the subgraph requires a string that matches a regular expression for a certain label). If that's not something that is a priority to implement, can someone steer me in the right direction so I may be able to implement it myself? I was contemplating using graph_tool.run_action or something to run the code in C++, but I'm not sure how/where to start. Thanks! Reem -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.
On 07/17/2014 03:21 PM, Reem Mokhtar wrote:
Hi,
I have a question/request:
I want to be able to match certain vertex/edge labels using a regular expression notation (i.e. if the subgraph requires a string that matches a regular expression for a certain label). If that's not something that is a priority to implement, can someone steer me in the right direction so I may be able to implement it myself? I was contemplating using graph_tool.run_action or something to run the code in C++, but I'm not sure how/where to start.
That is not implemented, but it seems unnecessary. Why don't you apply the regular expression first to all nodes, and store the result in a boolean property map, and use that? Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>
Thanks! -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.
participants (2)
-
Reem Mokhtar -
Tiago de Paula Peixoto