Graph Representation Methods for the Discrete Mathematics Instructions Set Computer

Graph operations and manipulation techniques are commonly used to solve many real-world issues, from effective networking to financial analysis. The Discrete mathematics Instruction Set Computer (DISC) for large dimension graphs processing was developed at Bauman University. So-call Structure Processing Unit (SPU), as a core of such a computer, implements a set of high-level discrete mathematics commands over key-value datasets. SPU's presence in the computer system frees CPU from managing RAM addresses for organizing complex data structures, such as trees, graphs, etc. In this paper, we introduce a special API for the DISC system for high-level graph operations. API allows designing data structures with a linear fields-based sorting. We consider a problem of the graph mapping onto SPU's memory as a template data structure and show some practical examples.