Construct triple groups for input vertices
A path List(e0,e1,...,em) is called an end-to-end path that, src of e0 is a source vertex that has no incoming edges, dst of em is a sink vertex that has no outgoing edges.List all end-to-end-paths in a graph.
A path List(e0,e1,...,em) is called an end-to-end path that, src of e0 is a source vertex that has no incoming edges, dst of em is a sink vertex that has no outgoing edges.List all end-to-end-paths in a graph.
the vertex attribute type (not used in the computation)
the edge attribute type (not used in the computation)
Assign each vertex to one partition according to its one attribute.
Construct triple groups for input vertices
Subject-based triples groups: s-TG of vertex v\inV is a set of triples in which their subject is v denoted by s-TG(v)= {(u,w)\(u,w)\inE, u = v}
Object-based triples groups: o-TG of vertex v\inV is a set of triples in which their object is v denoted by s-TG(v)= {(u,w)\(u,w)\inE, w = v}
Subject-object-based triple groups: so-TG of vertex v\inV is a set of triples in which their object is v denoted by s-TG(v)= {(u,w)\(u,w)\inE, v\in{u,w}}