We will need similar symbols for the input graph.
we define F (j , j) as the set of source phrases of all paths from graph node j to node j, or formally: Here, the conditions ensure that the edge sequence is a proper path from node j to node j in the input graph and that the corresponding source phrase isf = f G j 1 ,n 1 , ..., f G j I ,n I .