Abstract Orientable Incidence Structure and Algorithms for Finite Bounded Acyclic Categories. II. Data Structure and Fundamental Operations
share
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the weighs encode the algebraic structure between edges. The fundamental operations on this data structure are investigated from geometrical, categorical and programming perspectives.
READ FULL TEXT
