https://github.com/simgo123/planargraphlab

Tool to visualize algorithms on planar graphs
https://github.com/simgo123/planargraphlab

disjoint-paths flow-networks max-flow mixed-max-cut okamura-seymour planar-graphs planarity-test

Last synced: 6 days ago
JSON representation

Tool to visualize algorithms on planar graphs

• Host: GitHub
• URL: https://github.com/simgo123/planargraphlab
• Owner: SimGo123
• Created: 2023-07-14T19:25:26.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2023-10-03T18:57:55.000Z (over 1 year ago)
• Last Synced: 2024-11-10T13:43:29.701Z (2 months ago)
• Topics: disjoint-paths, flow-networks, max-flow, mixed-max-cut, okamura-seymour, planar-graphs, planarity-test
• Language: JavaScript
• Homepage:
• Size: 385 KB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# PlanarGraphLab

PlanarGraphLab is a visualization tool designed to help you run algorithms on planar graphs step-by-step.

With PlanarGraphLab, you can:

- [Draw a Graph](#draw-a-graph)

- [Run Algorithms on a Graph Step-by-Step](#run-algorithms)

- [Export/Import Graphs in a Special JSON Format](#json-format)

## Draw A Graph

### Creating

1. Select "Vertices"

2. Click on the canvas to place a vertex

3. Select "Edges"

4. Click on two vertices, one at a time, to add an edge

### Changing

- To move a vertex, select "Select", then click on the vertex to move and its new location on the canvas

- To delete a vertex/edge, select "Select", then click on the edge / the vertex to delete and select delete

### Predefined Graphs

1. Select "Predefined"

2. Select one of the predefined graphs

## Run Algorithms

1. Have a graph ready

2. Select "Algorithms"

3. Click on "Step" to perform a step of the algorithm or on "Run to completion" to run to completion

### Implemented Algorithms

- Triangulation

- Planar Separator

- Weight Max Matching

- Mixed Max Cut

- Max Flow

- Disjunct S-T Paths

- LR-Test for Planarity

- Disjunct paths between (source,target)-pairs (Okamura-Seymour)

## JSON Format

1. Select "JSON"

2. Use "Get current graph representation" to export or "Load graph from JSON" to import a graph