# How can I search and count all induced subgraphs in a directed graph with edge labels?

Hello all,

I can extract all induced subgraphs and count them in a graph. My question is how I can search and count all induced subgraphs in a labeled graph (a graph with edge labels)? In documentation of g.subgraph() and g.subgraph_search_count() is mentioned that these functions should work on labeled graphs as well. but it does not work. Here is an example:

```
sage: g=DiGraph()
sage: g.add_vertex(0)
sage: g.add_vertex(1)
sage: g.add_vertex(2)
sage: g.add_edge(0,1,label="a")
sage: g.add_edge(1,2,label="b")
sage: g.plot(color_by_label="true")
sage: g.plot(color_by_label=true)
sage: s=DiGraph()
sage: s.add_vertex(0)
sage: s.add_vertex(1)
sage: s.add_edge(0,1,label="a")
sage: s.plot(color_by_label=true)
sage: g.subgraph_search_count(s)
2
```

While it should return 1 not 2.

Welcome to ask-sage! To display code lines, either (a) select the code lines and press the "code" button (the one with '101 010') or (b) indent these lines by 4 spaces. Try editing your question to do that.

Thanks. it's done.