Debian Codegraph @

debian/control

raw
1 Source: libgraph-grammar-perl
2 Maintainer: Debian Perl Group <[email protected]>
3 Uploaders: Andrius Merkys <[email protected]>
4 Section: perl
5 Testsuite: autopkgtest-pkg-perl
6 Priority: optional
7 Build-Depends: debhelper-compat (= 13)
8 Build-Depends-Indep: libclone-perl <!nocheck>,
9 libgraph-moreutils-perl <!nocheck>,
10 libgraph-perl <!nocheck>,
11 libscalar-list-utils-perl <!nocheck>,
12 libset-object-perl <!nocheck>,
13 perl
14 Standards-Version: 4.7.0
15 Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libgraph-grammar-perl
16 Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libgraph-grammar-perl.git
17 Homepage: https://metacpan.org/release/Graph-Grammar
18 Rules-Requires-Root: no
19
20 Package: libgraph-grammar-perl
21 Architecture: all
22 Depends: ${misc:Depends},
23 ${perl:Depends},
24 libclone-perl,
25 libgraph-moreutils-perl,
26 libgraph-perl,
27 libscalar-list-utils-perl,
28 libset-object-perl
29 Description: Grammar for graphs
30 Graph::Grammar is a Perl implementation of a graph rewriting method (a.k.a.
31 graph grammar). Much of the API draws inspiration from Parse::Yapp, but
32 instead of acting on text streams Graph::Grammar is oriented at graphs, as
33 implemented in Perl's Graph module. Graph::Grammar implements a single method
34 parse_graph() which accepts an instance of Graph and an array of rules. Every
35 rule is evaluated for each vertex in a graph and, if a match is found, an
36 action associated with the rule is executed.