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 h
I have used SageMath in my thesis (via CoCalc) and would like to cite it.
Since I have been using "amsrefs" for citation, I would like to get a code
for the same. The webpage
"https://wiki.sagemath.org/Publications_using_SageMath"; doesn't provide the
code for "amsrefs".
--
You received this
On Wednesday, December 21, 2016 at 2:14:17 PM UTC-5, leonel torres salinas
wrote:
>
> Hello, i just wanted to try Sagemath in my computer
>
> Toshiba satellite l745d runing Fedora 25 with LXDE desktop
>
> I tried to execute it from the binaries but it wasn't enough for it
>
> Thank you for the s
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 shou
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 av
