Hello all, I was thinking about the differences between Graph homomorphism and Graph traversal operations. Can anyone help me on that?
I know that Graph homomorphism takes a data graph and a request graph as input. It is also easily possible to transform a graph traversal query into a graph then compute homomorphisms. On the other hand, the requested graph in the homomorphism operation may not be a connected graph. Can we say that the result of a homomorphism having as input a not-connected request graph, is the same that the union of the results when applying a graph traversal query with each of the connected components of the request? Thanks in advance, PAIVA LIMA DA SILVA Bruno _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
