Grid connector

Import / Export type: Connection list Vertex list (intended for walks) Connection chain (intended for walks)
Reset connections Undo Redo Import Export

Controls

- Hold left mouse button: connect circles with an edge.
- Hold right mouse button: disconnect circles by removing edge between them (if there is one).
- CTRL+Z: undo connection.
- CTRL+Y: redo connection.

Import/Export formats

Connection list

Connection list format is intended as universal format that allows importing/exporting any type of graph.

Format description:
- grid_size ∈ [1; 50]
- edge_i_from_idx, edge_i_to_idx ∈ [1; grid_size * grid_size] grid_size edge_1_from_idx edge_1_to_idx edge_2_from_idx edge_2_to_idx ... edge_n_from_idx edge_n_to_idx
Example with 5x5 grid: 5 1 12 12 19 8 19 8 15

Vertex list

Vertex list format is intended to import/export only a single walk in the graph.

Format description:
- grid_size ∈ [1; 50]
- vertex_i_idx ∈ [1; grid_size * grid_size] grid_size vertex_1_idx vertex_2_idx ... vertex_n_idx
Example with 5x5 grid: 5 1 12 19 8 15

Connection chain

Connection chain format is intended to import/export only a single walk in the graph.
Unlike connection list format, this format make sure that edge_(i)_to_idx always matches edge_(i+1)_from_idx

Format description:
- grid_size ∈ [1; 50]
- edge_i_from_idx, edge_i_to_idx ∈ [1; grid_size * grid_size] grid_size {{edge_1_from_idx, edge_1_to_idx}, {edge_2_from_idx, edge_2_to_idx}, ..., {edge_n_from_idx, edge_n_to_idx}}
Example with 5x5 grid: 5 {{1, 12}, {12, 19}, {19, 8}, {8, 15}}

Motivation

This page was made to aid solving graph connection related problems.

Problem 1: Given Hamiltonian cycle whose edges do not self-intersect, find such cycle that maximises d(G).

Problems author: Giedrius Alkauskas