Programming with Graphs
Guillaume Bonfante, Bruno Guillaume, Guy Perrier · 2018
This chapter discusses elements of programming for graphs. It considers the syntax of GREW in greater detail. GREW provides syntax for graph pattern matching. The GREW library features a syntax for describing patterns and offers the corresponding matching function. GREW offers a dedicated syntax to facilitate graph handling, notably in terms of feature structures. GREW also offers graph rewriting capacities following rewriting rules. The principle of computation by rewriting consists of recognizing certain patterns in a graph and transforming the recognized graph element using certain commands. The process continues for as long as rewriting remains possible. The GREW library may be used to separate rewriting computations from the PYTHON program. In this way, programmers are able to focus on the heart of the problem, pattern definition (and, subsequently, transformation), rather than actual programming tasks.