{"id":19423336,"url":"https://github.com/simgo123/planargraphlab","last_synced_at":"2025-02-25T04:29:25.010Z","repository":{"id":181292687,"uuid":"666537345","full_name":"SimGo123/PlanarGraphLab","owner":"SimGo123","description":"Tool to visualize algorithms on planar graphs","archived":false,"fork":false,"pushed_at":"2023-10-03T18:57:55.000Z","size":394,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-07T18:54:18.903Z","etag":null,"topics":["disjoint-paths","flow-networks","max-flow","mixed-max-cut","okamura-seymour","planar-graphs","planarity-test"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/SimGo123.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-07-14T19:25:26.000Z","updated_at":"2023-10-03T19:07:58.000Z","dependencies_parsed_at":"2023-07-18T11:45:45.252Z","dependency_job_id":"2778aafe-cf3c-4e7f-a5d8-79bcb9bff11c","html_url":"https://github.com/SimGo123/PlanarGraphLab","commit_stats":null,"previous_names":["simgo123/graphtool","simgo123/planargraphlab"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimGo123%2FPlanarGraphLab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimGo123%2FPlanarGraphLab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimGo123%2FPlanarGraphLab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SimGo123%2FPlanarGraphLab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SimGo123","download_url":"https://codeload.github.com/SimGo123/PlanarGraphLab/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240603200,"owners_count":19827657,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["disjoint-paths","flow-networks","max-flow","mixed-max-cut","okamura-seymour","planar-graphs","planarity-test"],"created_at":"2024-11-10T13:38:04.858Z","updated_at":"2025-02-25T04:29:24.952Z","avatar_url":"https://github.com/SimGo123.png","language":"JavaScript","readme":"# PlanarGraphLab\nPlanarGraphLab is a visualization tool designed to help you run algorithms on planar graphs step-by-step.\nWith PlanarGraphLab, you can:\n- [Draw a Graph](#draw-a-graph)\n- [Run Algorithms on a Graph Step-by-Step](#run-algorithms)\n- [Export/Import Graphs in a Special JSON Format](#json-format)\n\n## Draw A Graph\n### Creating\n1. Select \"Vertices\"\n2. Click on the canvas to place a vertex\n3. Select \"Edges\"\n4. Click on two vertices, one at a time, to add an edge\n\n\n### Changing\n- To move a vertex, select \"Select\", then click on the vertex to move and its new location on the canvas\n- To delete a vertex/edge, select \"Select\", then click on the edge / the vertex to delete and select delete\n\n\n### Predefined Graphs\n1. Select \"Predefined\"\n2. Select one of the predefined graphs\n\n## Run Algorithms\n1. Have a graph ready\n2. Select \"Algorithms\"\n3. Click on \"Step\" to perform a step of the algorithm or on \"Run to completion\" to run to completion\n\n\n### Implemented Algorithms\n- Triangulation\n- Planar Separator\n- Weight Max Matching\n- Mixed Max Cut\n- Max Flow\n- Disjunct S-T Paths\n- LR-Test for Planarity\n- Disjunct paths between (source,target)-pairs (Okamura-Seymour)\n\n## JSON Format\n1. Select \"JSON\"\n2. Use \"Get current graph representation\" to export or \"Load graph from JSON\" to import a graph\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimgo123%2Fplanargraphlab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsimgo123%2Fplanargraphlab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimgo123%2Fplanargraphlab/lists"}