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.
