Home Compiler Docs About

GraphLangZ

Generate beautiful graphs effortlessly.

GraphLangZ is a program where anyone regardless of prior programming experience can describe a graph structure with simple syntax, render it quickly, and share it with ease. There is no need to install any software and GraphLangZ is designed to look good and work "out of the box" with minimal effort.

Simple & Concise Syntax

GraphLangZ was designed to be easy to learn, with simple yet versatile features.

// make all nodes red
#global node_color red
// Create edges from A to B and A to C,
// each edge labelled as "friends"
A <> {B, C} "friends"
// Draw B with a blue color
B := color(blue)

Automatic Layouts

GraphLangZ calculates an optimal graph layout using physics-based forces, where connected nodes are attracted to each other through a spring force and all other nodes repel each other via particle forces.

After the initial layout is calculated the user can manually change node positions if any correction is needed by clicking and dragging individual nodes to any location. The new positions are saved in the code and are recognized by the compiler.

There is no randomness within the compiler, guarenteeing that the same code will always output the same graph.

An example graph of the Untied States, with edges between geographical neighbors.

Embed it Online

Generate a public url to share your graph anywhere on the web. Easily embed it in your own website with an HTML iframe element. You can download the graph as an image too.

You can also download the graph as a high-resolution image, with HD and 4K supported.

Try hovering your mouse over or tapping the nearby interactive graph: