Gram - a lightweight graph exchange format

100%

Gram - a lightweight graph exchange format

✓ Published0🌍 Public

Last edited Aug 30, 2019

Created on Aug 30, 2019

This example shows a lightweight graph exchange format called gram, which represents graph data as a series of path updates. The format defines syntax for nodes, labels, properties, and various data types including numbers, fractions, dates, colors, and text formats. It uses tagged string literals like `date`, `d`, `frac`, `color`, and `url` to specify data types. The template pattern lists demonstrate how to apply property schemas to multiple nodes, using placeholders like `_` for missing values.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 909583a7882aa8a80ef2bb129b27d2d4

This example demonstrates a grammar for describing graph structures, including nodes, relationships, and paths, using a compact textual notation. It defines a node with a label and property, a relationship between two nodes, and a path that traverses multiple relationships through intermediate nodes. The code likely parses this grammar to generate a visual graph representation, though the rendering logic is not shown. It uses a custom grammar format rather than a standard visualization library, focusing on the syntactic layer for graph data description.

Aakollegger

72% match

Loading thumbnail…

Gist 2768d4a5ea98e385b30ffc99390cddb7

This example demonstrates a custom JSON encoder for serializing graph data structures. It shows how Python’s `json.JSONEncoder` is extended to convert `graph.Node` and `graph.Relationship` objects into a plain dictionary format, capturing element IDs, labels, properties, and relationship endpoints. The encoder uses `json.dumps` under the hood but overrides the `default` method to handle graph-specific types. The code relies on the `graph` module’s `Node` and `Relationship` classes, and its output is a JSON-friendly representation suitable for further visualization or data exchange.

Aakollegger

55% match

Loading thumbnail…

pgm

This example demonstrates a probabilistic graph model built from a small set of word-pair sentences, tracking entity counts and conditional probabilities between vertices and edges. The Go code constructs a PGM struct with vertex and edge maps, using UUIDs from `github.com/satori/go.uuid` for unique identifiers. It implements upsert operations with mutex locking to update counts and properties, then prints global and conditional probabilities for the word "what" based on edge counts relative to totals. The visualization shows how sequential word relationships are stored and queried in a directed graph structure.

Aadkatrit

55% match

Loading thumbnail…

Graph Gist

This example shows a small graph of people and their database preferences, capturing two `Person` nodes connected by `LIKE` relationships to database nodes labeled `Database`, `NoSql`, and `Graph`. The visualization renders this graph data using D3.js, likely with a force-directed layout (`d3.forceSimulation`) to position nodes and links, and possibly `d3.geoPath` or standard SVG/CSS for shapes and labels. The source code, authored by CliffordAnderson and stored as a Gist, explicitly creates the nodes and relationships with Cypher, returning them for immediate display. The result emphasizes how graph structures and their labels can be directly mapped from query output to interactive visual elements.

CCliffordAnderson

53% match

Loading thumbnail…

Just a Test

This example renders a directed graph as a sentence parse tree, showing the hierarchical structure of the phrase "This is an example sentence." The nodes represent grammatical categories (TOP, S, NP, VP) and tokens (This, is, an, example, .), with edges connecting parents to children. Code uses the dagre-d3 library’s `Graph`, `render`, and `setNode`/`setEdge` APIs to compute a layered layout and draw it on an SVG. Custom CSS styles round the node corners and highlight token nodes (type-TK) in teal. The D3 selection `d3.select('svg')` appends a group for the rendered output.

Wwilliamhsu0502

52% match

Loading thumbnail…

Gist 1396daa6c6389ff4370613d70dc355d5

The visualization shows a directed route graph where three nodes—a, b, and c—are connected sequentially via CONNECTS relationships, forming a simple path. It uses d3.forceSimulation to position the nodes and render them as circles, while links are drawn as straight lines between them. The graph is defined in a myPath.gram file, which specifies the node and relationship structure. The code relies on D3.js for simulation and SVG rendering, presenting a minimal example of force-directed layout for a linear path.

Aakollegger

52% match

Loading thumbnail…

OP file, compilable by jison-gho. SO: https://stackoverflow.com/posts/58902159

This example demonstrates a Jison-gho lexer and parser grammar for a custom GIF-like code language, converting token sequences into an abstract syntax tree. The lexer uses state management (`begin`, `popState`, `delimit` and `string_literal` states) to enforce semicolon delimiters between tokens and handle quoted strings. The parser defines operator precedence with `%left` declarations and builds AST nodes via `new yy.Stmt` and `new yy.Expr` constructors, processing number literals, identifiers, and control flow keywords. The grammar handles numeric formats and string concatenation rules visible in rules like `UFloat` and `AlfanumAtom`.

GGerHobbelt

52% match

Loading thumbnail…

GraphML data

This example visualizes a directed graph of library catalog records, showing nodes for authors, works, and subject categories connected by edges. The graph uses GraphML data parsed from an XML file, with node labels and properties like author names and categories displayed. The visualization is rendered using D3.js force-directed layout, where nodes are positioned by a physics simulation and edges show relationships. The data comes from a gist by CliffordAnderson, illustrating a bibliographic network.

CCliffordAnderson

52% match