{"id":19007534,"url":"https://github.com/helgee/itemgraphs.jl","last_synced_at":"2025-09-19T05:23:12.498Z","repository":{"id":61798386,"uuid":"113149431","full_name":"helgee/ItemGraphs.jl","owner":"helgee","description":"Shortest paths between items","archived":false,"fork":false,"pushed_at":"2020-02-08T15:35:01.000Z","size":46,"stargazers_count":2,"open_issues_count":1,"forks_count":3,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-15T06:50:37.203Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/helgee.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-12-05T07:41:27.000Z","updated_at":"2023-11-24T02:59:42.000Z","dependencies_parsed_at":"2022-10-21T11:00:57.344Z","dependency_job_id":null,"html_url":"https://github.com/helgee/ItemGraphs.jl","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"purl":"pkg:github/helgee/ItemGraphs.jl","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/helgee%2FItemGraphs.jl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/helgee%2FItemGraphs.jl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/helgee%2FItemGraphs.jl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/helgee%2FItemGraphs.jl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/helgee","download_url":"https://codeload.github.com/helgee/ItemGraphs.jl/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/helgee%2FItemGraphs.jl/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275883256,"owners_count":25545495,"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","status":"online","status_checked_at":"2025-09-19T02:00:09.700Z","response_time":108,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-11-08T18:38:41.942Z","updated_at":"2025-09-19T05:23:12.449Z","avatar_url":"https://github.com/helgee.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# ItemGraphs\n\n*Shortest paths between items*\n\n[![Build Status Unix][travis-badge]][travis-url] [![Build Status Windows][av-badge]][av-url] [![Coveralls][coveralls-badge]][coveralls-url] [![Codecov][codecov-badge]][codecov-url] [![Docs Stable][docs-badge-stable]][docs-url-stable] [![Docs Latest][docs-badge-dev]][docs-url-dev]\n\n**ItemGraphs** is a simple wrapper around [LightGraphs](https://github.com/JuliaGraphs/LightGraphs.jl) that\nenables my most common use case for graph-like data structures:\nI have a collection of items that are in relations between each other and I want to get the shortest path\nbetween two items.\nThat's it!\n\n## Installation\n\nThe package can be installed through Julia's package manager:\n\n```julia\njulia\u003e import Pkg; Pkg.add(\"ItemGraphs\")\n```\n\n## Quickstart\n\n```julia\n# Create an ItemGraph that has integers as vertices\ng = ItemGraph{Int}()\n\n# Add some vertices\nadd_vertex!(g, 101)\nadd_vertex!(g, 202)\n\n# Add some edges. If the vertices do not exists, they will be added as well\nadd_edge!(g, 101, 202)\nadd_edge!(g, 202, 303)\nadd_edge!(g, 202, 404)\n\n# Get the shortest path, returns [101, 202, 404]\nitems(g, 101, 404)\n\n# Create an ItemGraph that has integers as vertices and floats as edges\ng = ItemGraph{Int, Float64}()\nadd_edge!(g, 101, 202, 1.0)\nadd_edge!(g, 202, 303, 2.0)\nadd_edge!(g, 202, 404) # The item assigned to the edge will be zero by default\n\n# Get all items on the edges between 101 and 404, returns [1.0, 0.0]\nedgeitems(g, 101, 404)\n```\n\n## Documentation\n\nPlease refer to the [documentation][docs-url-stable] for additional\ninformation.\n\n[travis-badge]: https://travis-ci.org/helgee/ItemGraphs.jl.svg?branch=master\n[travis-url]: https://travis-ci.org/helgee/ItemGraphs.jl\n[av-badge]: https://ci.appveyor.com/api/projects/status/b6lb3lgtxeg2fr51?svg=true\n[av-url]: https://ci.appveyor.com/project/helgee/itemgraphs-jl\n[coveralls-badge]: https://coveralls.io/repos/github/helgee/ItemGraphs.jl/badge.svg?branch=master\n[coveralls-url]: https://coveralls.io/github/helgee/ItemGraphs.jl?branch=master\n[codecov-badge]: http://codecov.io/github/helgee/ItemGraphs.jl/coverage.svg?branch=master\n[codecov-url]: http://codecov.io/github/helgee/ItemGraphs.jl?branch=master\n[docs-badge-dev]: https://img.shields.io/badge/docs-dev-blue.svg\n[docs-url-dev]: https://helgee.github.io/ItemGraphs.jl/dev/\n[docs-badge-stable]: https://img.shields.io/badge/docs-stable-blue.svg\n[docs-url-stable]: https://helgee.github.io/ItemGraphs.jl/stable/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhelgee%2Fitemgraphs.jl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhelgee%2Fitemgraphs.jl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhelgee%2Fitemgraphs.jl/lists"}