Answers are grounded in this paper and cite their sources.
Development of a domain-specific language enhances graph algorithm usability and efficiency.
The purpose of this paper is to develop a specialized language for processing graph data and its software implementation. The proposed solution ensures versatility, usability, and efficiency, enabling the execution of both basic graph operations and more complex procedures. The tool supports classical graph algorithms, including shortest path search, graph traversal, and minimum spanning tree construction, as well as applications in modeling and analyzing message transition processes and processing graph-based representations of textual data. A common drawback of many existing graph analysis tools—often implemented as libraries of general-purpose programming languages—is their limited usability. This limitation arises from the fact that the description of graph analysis procedures relies on data structure operations defined in terms of these general-purpose languages, which complicates perception and reduces the clarity of the mathematical methods being implemented. Developing a specialized domain-specific language based on high-level abstractions can address these shortcomings. Such a language will provide a formalized description of methods for analyzing and processing graph models, improving their comprehensibility and accessibility to users. Its software implementation will deliver ready-to-use solutions for executing graph analysis methods. Composing such methods will facilitate solving a wide range of tasks, including the analysis of natural language messages and the study of information publication and dissemination processes in online environments.
No takes yet. Share an insight, caveat, or question.
Zgurovsky et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: