es.weso.rbe

And(v1,v2) represents both v1 and v2

A neighbor of a node through a direct edge

Represents directed edges

It can be direct or inverse

Empty RBE

Fail RBE doesn't match

Generic representation of graphs

Implementation of graph as a map

A neighbor of a node through an inverse edge

Represents a neighbor of a node in a graph. It can be a direct arc or an inverse arc

Or(v1,v2) represents either v1 or v2

Plus(v) represents 1 or more appearances of v

This trait defines Single Occurrence Regular Bag Expressions (Rbe)

== Further info ==

The algorithm to check that a Rbe contains a bag is PTIME The algorithm has been described in [1] and is based on intervals

[1] Complexity and Expressiveness of ShEx for RDF, S. Staworko, I. Boneva, J. Labra, S. Hym, E. Prud'hommeaux, H. Solbrig

Repeat(v,n,m) represents between n and m apperances of v

Defines a Schema which is a map from Labels to Shapes

A shape contains a regular bag expression, a closed modifier and a list of extras

Star(v) represents 0 or more v

Simple graphs whose nodes and edges are strings They are used for testing purposes mainly

Represents a symbol that is repeated between n and m times (m can be unbounded)