[sage-support] Re: FInd all paths of given length n
There is a typo in the code above. The True argument belongs to the
subgraph_search_iterator function, not the PathGraph, that is,
g.subgraph_search_iterator(graphs.PathGraph(3), induced=True)
On Thursday, July 27, 2017 at 10:16:29 AM UTC-4, fidelbc wrote:
>
> Not directly, but it shouldn't be hard to just keep track of which vertex
> sets you have seen so far. Eg.
> seen = {}
> for p in g.subgraph_search_iterator(graphs.PathGraph(3, induced=True)):
> vxs = tuple(sorted(p))
> if vxs not in seen:
> seen[vxs]=True
> print vxs
>
> Note that you should include induced=True in the call to
> subgraph_search_iterator, since induced is False by default.
>
> On Thursday, July 27, 2017 at 4:42:18 AM UTC-4, Selvaraja S wrote:
>>
>> Thanks for the response.
>>
>> sage: g=Graph(d)
>> sage: for p in g.subgraph_search_iterator(graphs.PathGraph(3)):
>> print(p)
>>
>> This is giving the all the paths of length 3. But I have one more
>> question.
>>
>> Suppose $xyz$ is induced path of length 3. Note that $zyx$ is also
>> induced path of length.
>> Can I avoid this path?
>>
>>
>>
>> On Thursday, July 27, 2017 at 12:07:04 PM UTC+5:30, fidelbc wrote:
>>>
>>> Yes we can. Suppose the path has length k and thus k+1 vertices. Then
>>> the following command returns an iterator over all lists of vertices that
>>> induce paths on k+1 vertices in G.
>>>
>>> G.subgraph_search_iterator(graphs.PathGraph(k+1),induced=True)
>>>
>>> More on this may be found at [1].
>>>
>>> [1];
>>> http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.subgraph_search_iterator
>>>
>>> On Thursday, July 27, 2017 at 12:37:31 AM UTC-4, Selvaraja S wrote:
Let $G$ be a finite simple graph.
Can we find all paths(induced ) of given length?
Thanks in advance.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
[sage-support] Re: FInd all paths of given length n
Not directly, but it shouldn't be hard to just keep track of which vertex
sets you have seen so far. Eg.
seen = {}
for p in g.subgraph_search_iterator(graphs.PathGraph(3, induced=True)):
vxs = tuple(sorted(p))
if vxs not in seen:
seen[vxs]=True
print vxs
Note that you should include induced=True in the call to
subgraph_search_iterator, since induced is False by default.
On Thursday, July 27, 2017 at 4:42:18 AM UTC-4, Selvaraja S wrote:
>
> Thanks for the response.
>
> sage: g=Graph(d)
> sage: for p in g.subgraph_search_iterator(graphs.PathGraph(3)):
> print(p)
>
> This is giving the all the paths of length 3. But I have one more question.
>
> Suppose $xyz$ is induced path of length 3. Note that $zyx$ is also induced
> path of length.
> Can I avoid this path?
>
>
>
> On Thursday, July 27, 2017 at 12:07:04 PM UTC+5:30, fidelbc wrote:
>>
>> Yes we can. Suppose the path has length k and thus k+1 vertices. Then the
>> following command returns an iterator over all lists of vertices that
>> induce paths on k+1 vertices in G.
>>
>> G.subgraph_search_iterator(graphs.PathGraph(k+1),induced=True)
>>
>> More on this may be found at [1].
>>
>> [1];
>> http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.subgraph_search_iterator
>>
>> On Thursday, July 27, 2017 at 12:37:31 AM UTC-4, Selvaraja S wrote:
>>>
>>> Let $G$ be a finite simple graph.
>>> Can we find all paths(induced ) of given length?
>>>
>>>
>>> Thanks in advance.
>>>
>>>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
[sage-support] Re: FInd all paths of given length n
Thanks for the response. sage: g=Graph(d) sage: for p in g.subgraph_search_iterator(graphs.PathGraph(3)): print(p) This is giving the all the paths of length 3. But I have one more question. Suppose $xyz$ is induced path of length 3. Note that $zyx$ is also induced path of length. Can I avoid this path? On Thursday, July 27, 2017 at 12:07:04 PM UTC+5:30, fidelbc wrote: > > Yes we can. Suppose the path has length k and thus k+1 vertices. Then the > following command returns an iterator over all lists of vertices that > induce paths on k+1 vertices in G. > > G.subgraph_search_iterator(graphs.PathGraph(k+1),induced=True) > > More on this may be found at [1]. > > [1]; > http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.subgraph_search_iterator > > On Thursday, July 27, 2017 at 12:37:31 AM UTC-4, Selvaraja S wrote: >> >> Let $G$ be a finite simple graph. >> Can we find all paths(induced ) of given length? >> >> >> Thanks in advance. >> >> -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
[sage-support] Re: FInd all paths of given length n
Yes we can. Suppose the path has length k and thus k+1 vertices. Then the following command returns an iterator over all lists of vertices that induce paths on k+1 vertices in G. G.subgraph_search_iterator(graphs.PathGraph(k+1),induced=True) More on this may be found at [1]. [1]; http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.subgraph_search_iterator On Thursday, July 27, 2017 at 12:37:31 AM UTC-4, Selvaraja S wrote: > > Let $G$ be a finite simple graph. > Can we find all paths(induced ) of given length? > > > Thanks in advance. > > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
