Hello,
I am not sure that I understood your message very well. Are you saying
that one way to achieve what you do would be to call the current
"subgraph_search" methods, and to *filter* among its results those
which are actually *equal* (considering edge labels) to the graph you
are looking for?
Hello,
Right now, no. My graphs do not have parallel edges.
You are right it is horrible to provide an efficient implementation for
labeled subgraph extractions. Just one idea makes my mind busy. I believe
what makes the function "subgraph" does not work for labeled graphs is
isomorphic check
Helloo,
Just, how can I search induced subgraphs in labeled graphs? This is the
> main problem. Are there any method or suggestion which helps me to do that?
>
Hmm Well, at the moment I would say that there is none. No way to
find induced subgraph of labelled digraphs. Even though f
Hello Nathann,
Thank you for your comments and follow up for creating a ticket. Apparently
the text of the documentation is already changed. Just, how can I search
induced subgraphs in labeled graphs? This is the main problem. Are there
any method or suggestion which helps me to do that?
Rega
I created ticket #18296 to try to make it clearer.
http://trac.sagemath.org/ticket/18296
Nathann
On Thursday, April 23, 2015 at 2:46:01 PM UTC+2, Nathann Cohen wrote:
>
> By the way: in Sage, you do not need to create the vertices before
> creating the edges. Adding the edges will also add the
By the way: in Sage, you do not need to create the vertices before creating
the edges. Adding the edges will also add the vertices.
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving email
Hello,
These functions do not take edge labels into account. When the
documentation says that it counts/enumerates/find 'labeled' copies of a
graph, it means precisely that the number of copies of a graph G in itself
is equal to the size of Aut(G), the automorphism group of G.
It is the same t
