1 | initial version |
Hello !
When you call G.subgraph_search_iterator(H)
, the first vertex of the list is matched with H.vertices()[0]
, the second with H.vertices()[1]
, etc ... So you know how edges of H
are mapped to edges of G
1- This should appear in the documentation of subgraph_search_iterator
-- if it does not, that should be fixed
2- It would be better to ask questions on our sage-devel or sage-support google group. If you were to answer my comment I would have no way to know, while Google groups sends us emails in that case. That's way easier :-P
Have fuuuuuuuuuuuuuuuuuuuuuuuuuuun !
Nathann
2 | No.2 Revision |
Hello !
When you call G.subgraph_search_iterator(H)
, the first vertex of the list is matched with H.vertices()[0]
, the second with H.vertices()[1]
, etc ... So you know how edges of H
are mapped to edges of G
1- This should appear in the documentation of subgraph_search_iterator
-- if it does not, that should be fixed
fixed
2- It would be better to ask questions on our sage-devel or sage-support google group. If you were to answer my comment I would have no way to know, while Google groups sends us emails in that case. That's way easier :-P
Have fuuuuuuuuuuuuuuuuuuuuuuuuuuun !
Nathann