{"id":18444944,"url":"https://github.com/filipporanza/simplegraph","last_synced_at":"2025-04-14T22:56:31.720Z","repository":{"id":41812807,"uuid":"486206953","full_name":"FilippoRanza/simplegraph","owner":"FilippoRanza","description":"A simple graph implementation","archived":false,"fork":false,"pushed_at":"2022-06-07T16:41:07.000Z","size":63,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-04-14T22:56:28.585Z","etag":null,"topics":["adjacency-list","adjacency-matrix","graph","graph-library"],"latest_commit_sha":null,"homepage":"https://crates.io/crates/simplegraph","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/FilippoRanza.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-04-27T13:36:37.000Z","updated_at":"2022-05-04T17:08:19.000Z","dependencies_parsed_at":"2022-08-11T18:11:14.619Z","dependency_job_id":null,"html_url":"https://github.com/FilippoRanza/simplegraph","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fsimplegraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fsimplegraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fsimplegraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fsimplegraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FilippoRanza","download_url":"https://codeload.github.com/FilippoRanza/simplegraph/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248975330,"owners_count":21192208,"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":["adjacency-list","adjacency-matrix","graph","graph-library"],"created_at":"2024-11-06T07:04:21.188Z","updated_at":"2025-04-14T22:56:31.701Z","avatar_url":"https://github.com/FilippoRanza.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# simplegraph\n![Test](https://github.com/FilippoRanza/simplegraph/workflows/Rust/badge.svg) ![crates.io](https://img.shields.io/crates/v/simplegraph.svg)\n[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=round-square)](http://makeapullrequest.com)\n\n**simplegraph** provides a simple graph implementation \nin Rust. \n\n## Features\n**simplegraph** aims to be as simple as possible while providing \nall the features that I need. \nYou can consider using **simplegraph** if you need:\n- support for direct and undirected graphs;\n- [Adjacency List](https://en.wikipedia.org/wiki/Adjacency_list) or [Adjacency Matrix](https://en.wikipedia.org/wiki/Adjacency_matrix) based graphs;\n- Graph to [Graphviz](https://en.wikipedia.org/wiki/Adjacency_list) (dot) source conversion;\n- Serialization and Deserialization support with [Serde](https://serde.rs/);\n- dynamic arc insertion;\n- update arc's and nodes' weights. \n\nOn the other side some intentional restriction are set on the graphs:\n- the number of nodes is set at creation time \n- nodes' and arcs' weights *must* implement [num_traits::Num](https://docs.rs/num-traits/latest/num_traits/trait.Num.html)\n- weights are always present: it is not possible to create a simple unweighted graph.\n\n**simplegraph** does not provide any check on the operation performed on it. It is \ncaller's responsibility to ensure operations soundness.\n\n## Why?\nTo my best knowledge [petgrah](https://github.com/petgraph/petgraph) \nis the most used general purpose graph library for Rust. \nIt is a very complete and complex library that allows to implement complex \ngraphs for various purposes. \nIf you choose/need to use a graph library you should check it out too. \n\n**simplegraph** aims to be a simple *wrap* around adjacency list or matrix. \nI've implemented this library mainly for my own use and avoid \nsome - from my point of view - needless complexities. So it may \nlack some features that I'll add just when, and if, I'll need them. \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffilipporanza%2Fsimplegraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffilipporanza%2Fsimplegraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffilipporanza%2Fsimplegraph/lists"}