GraphPower returns the k-th power graph of a given graph which may be directed or undirected. In the k-th power graph, two vertices are connected if there exists a path of length at most k in the original graph.

The algorithm adds powers the adjacency matrix of G and removes any multiple edges.