# Sub-Graph Isomorphism for graphs with multiple edge types and multiple node types

I found that there are algorithms like VFlib and LAD filtering for subgraph isomorphism with one edge type. For multiple node types,one idea could be color all node types with the same type and use colored sub-graph isomorphism which is available for VFlib. I was wondering is there any algo specifically for multiple edge types or should I modify existing algo to check for edge types also?

You can replace each edge $(u,v)$ with two edges $(u,t_0)$ and $(t_0,v)$ where $t_0$ is a new vertex (a different one for each edge you replace), and then color the vertex $t_0$ based on the type of the edge $(u,v)$.