GML - Graph Merging Library

This tab is using the naïve graph BWT, which can only handle the very simplest graphs and has been discontinued. Please do not expect anything on this tab to actually work.

Here, you can enter a simple graph in bubble notation.

It will be converted into a naïve graph BWT.

Please enter the graph in bubble notation that you are interested in:

Info

Generate naïve graph BWT

This tab is using the naïve graph BWT, which can only handle the very simplest graphs and has been discontinued. Please do not expect anything on this tab to actually work.

Here, you can enter two simple graphs in bubble notation.

They will both be converted into naïve graph BWTs.

These BWTs will then be merged.

Please enter the two graphs in bubble notation that you are interested in:

Info

Generate naïve graph BWTs

Merge naïve graph BWTs Info

Here, you can enter a graph.

It will be converted into a prefix-sorted automaton.

The automaton will be used to initialize an XBW environment, in which path queries and substring searches can be executed.

Please enter the graph that you are interested in:

Open FFX File Open GML File Randomize Info

Generate tables

Run randomized tests

Run predefined tests

Here, you can enter two graphs.

They will both be converted into prefix-sorted automata.

The automata will then be merged.

The resulting automaton will be used to initialize an XBW environment, in which path queries and substring searches can be executed.

Please enter the two graphs that you are interested in:

Randomize Info

Merge node tables

Run randomized tests

Run predefined tests

Verbosity: tell me everything

X Show XBW environments

Show tabs for naïve graph functionality

Predefined tests check if invalid inputs are recognized

Do prefix doubling in node table merging

X Use Windows newline characters when saving files (uncheck for POSIX)

Use XPC, which does not work, to show why it does not work

The first element of any string and array is obviously .

Stop all loops after going through cycles (this value is referred to as “loop threshold”.)

The following options all concern the graph visualization:

X Show # node in graphs

X Show $ node in graphs

Rearrange graphs even when it is not strictly necessary

Find the shortest path as main row when reorganizing graphs

X Alternate sides on which subgraphs are displayed

X When saving SVG files, use Times New Roman as LaTeX-like font

Override automatic width and set to pixels instead.

Invert highlight colors

Show auto i above automaton nodes

Show I/O degree counts above automaton nodes

Apply Options

Reset Options

Here, you can enter two graphs.

They will both be converted into prefix-sorted automata.

The automata will then be used to initialize XBW environments.

Nodes within these individual XBW environments will then be split up if necessary.

The individual XBW environments will then be merged.

In the merged XBW environment, path queries and substring searches can finally be executed.

Please enter the two graphs that you are interested in:

Randomize Info

Merge flat tables

Run randomized tests

Run predefined tests

Here, you can enter two graphs.

They will both be converted into prefix-sorted automata.

The automata will then be used to initialize XBW environments.

The individual XBW environments will then be fused together without being merged node for node.

In the fused XBW environment, path queries and substring searches can finally be executed.

Please enter the two graphs that you are interested in:

Randomize Info

Fuse flat tables

Run randomized tests

Run predefined tests