In mathematics, and particularly in category theory, a polygraph is a generalisation of a directed graph.
They were introduced as "polygraphs" by Albert Burroni[1] and as "computads" by Ross Street.
[2] In the same way that a directed multigraph can freely generate a category, an n-computad is the "most general" structure which can generate a free n-category.
This category theory-related article is a stub.
You can help Wikipedia by expanding it.