{"id":18248626,"url":"https://github.com/an-iceberg/rust_graph_visualiser","last_synced_at":"2025-10-04T14:37:48.175Z","repository":{"id":122921574,"uuid":"600142190","full_name":"an-Iceberg/rust_graph_visualiser","owner":"an-Iceberg","description":"A small program to showcase what a «graph» typically refers to in computer science. It's also capable of finding the shortest path between two points.","archived":false,"fork":false,"pushed_at":"2023-12-16T18:13:39.000Z","size":20232,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T15:47:42.300Z","etag":null,"topics":["dijkstra-algorithm","dijkstra-shortest-path","dijkstras-algorithm","egui","graph","graph-algorithms","macroquad","rust","rust-lang","visualization","wasm"],"latest_commit_sha":null,"homepage":"https://an-iceberg.github.io/rust_graph_visualiser/","language":"Rust","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/an-Iceberg.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-02-10T17:19:21.000Z","updated_at":"2024-09-27T20:47:43.000Z","dependencies_parsed_at":"2023-12-15T20:24:20.112Z","dependency_job_id":"ad644542-f7a8-4a21-91b0-969792b7f0a2","html_url":"https://github.com/an-Iceberg/rust_graph_visualiser","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/an-Iceberg%2Frust_graph_visualiser","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/an-Iceberg%2Frust_graph_visualiser/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/an-Iceberg%2Frust_graph_visualiser/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/an-Iceberg%2Frust_graph_visualiser/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/an-Iceberg","download_url":"https://codeload.github.com/an-Iceberg/rust_graph_visualiser/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247918931,"owners_count":21018043,"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":["dijkstra-algorithm","dijkstra-shortest-path","dijkstras-algorithm","egui","graph","graph-algorithms","macroquad","rust","rust-lang","visualization","wasm"],"created_at":"2024-11-05T09:37:51.781Z","updated_at":"2025-10-04T14:37:43.139Z","avatar_url":"https://github.com/an-Iceberg.png","language":"Rust","readme":"\u003ch1 align=\"center\"\u003e\n  \u003cimg width=\"200\" alt=\"Rust Graph Visualiser Logo\" src=\"./rust_graph_vis_logo.png\"\u003e\n  \u003cbr\u003e\n  Rust Graph Visualiser\n\u003c/h1\u003e\n\n## Contents\n- [Description](#description)\n- [Screenshots](#screenshots)\n- [Installation](#installation)\n  - [Precompiled binaries](#precompiled-binaries)\n  - [Compile from source](#compile-from-source)\n- [Possible future additions (no guarantee)](#possible-future-additions-no-guarantee)\n- [Acknowledgements](#acknowledgements)\n\n![](rainbow_bar.png)\n\n## Description\nA visualisation program that showcases what a graph is (in the context of \u003cabbr title=\"computer science\"\u003eCS\u003c/abbr\u003e).\nIt allows the user to create a graph that has at most 100 nodes and to connect those nodes freely with\nweighted edges. Bidirectional edges are also supported. One can also specify a start and end node and\nif possible the program tires to find the shortest path between the two.\n\nAll the instructions and configurations can be done inside the program, although the configuration isn't\npersistent.\n\nThis program is also available as a [web app](https://an-iceberg.github.io/rust_graph_visualiser).\n\n![](rainbow_bar.png)\n\n## Screenshots\n\n![](Screenshot%202023-12-16%20185315.png)\n\n![](rainbow_bar.png)\n\n## Installation\n\n### Precompiled binaries\n\nPrecompiled binaries are available for Linux and Windows. Download the\n[latest version](https://github.com/an-Iceberg/rust_graph_visualiser/releases/latest)\nfrom the [releases page](https://github.com/an-Iceberg/rust_graph_visualiser/releases).\n\n### Compile from source\n\n1. Make sure the latest version of [Rust](https://www.rust-lang.org/) is installed on your system.\n2. Clone this repository onto your machine: `git clone https://github.com/an-Iceberg/rust_graph_visualiser \u0026\u0026 cd ./rust_graph_visualiser`\n3. Compile the program with: `cargo build --release`\n4. After it is done compiling the binary can be found at `rust_graph_visualiser/target/release/`.\n\n![](rainbow_bar.png)\n\n## Possible future additions (no guarantee)\n- Minimum spanning tree\n\n![](rainbow_bar.png)\n\n## Acknowledgements\n- Creator of the cmatrix `README` for the awesome idea of the rainbow bar.\n- [Javidx9](https://github.com/OneLoneCoder) (aka. OneLoneCoder) for being an awesome teacher\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fan-iceberg%2Frust_graph_visualiser","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fan-iceberg%2Frust_graph_visualiser","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fan-iceberg%2Frust_graph_visualiser/lists"}