This study presents polygraphic programs as an algebraic and graphical description of first-order functional programs. We prove that they form a Turing-complete computational model. Using analysis tools called polygraphic interpretations, we delineate a subclass of these objects and study their computational properties: these polygraphic programs compute exactly polynomial-time functions.