Help


from Wikipedia
« »  
Any directed graph generates a small category: the objects are the vertices of the graph, and the morphisms are the paths in the graph ( augmented with loops as needed ) where composition of morphisms is concatenation of paths.
Such a category is called the free category generated by the graph.

2.132 seconds.