Author: Huiting Su

 A cycle is a path of edges and vertices that connect together to form a loop. In a directed graph, all the edges must point in the same direction so that one can "travel" around the cycle. In a sample social graph (Fig.1), George, Howard...

In this short technical blog, I will show you how to use GSQL to search a graph for all the occurrences of a small graph pattern.  We call this pattern matching. Consider the problem of matching a pattern of vertices and directed edges in a graph...