For each document, TEXTRANK builds a directed graph G = (V, E) with nodes V corresponding to sentences, and undirected edges E whose weights are computed based on sentence similarity.
edge weights are represented with matrix E where each element E i,j corresponds to the transition probability from vertex i to vertex j.