Finding Paths and Cycles in Graphs

Abstract

A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).