{"id":37164248,"url":"https://github.com/juliagraphs/networks.jl","last_synced_at":"2026-01-14T19:30:55.194Z","repository":{"id":149745395,"uuid":"45255119","full_name":"JuliaGraphs/Networks.jl","owner":"JuliaGraphs","description":"(DEPRECATED) Additional graph flexibility for LightGraphs","archived":true,"fork":false,"pushed_at":"2017-07-29T19:50:39.000Z","size":32,"stargazers_count":3,"open_issues_count":5,"forks_count":4,"subscribers_count":6,"default_branch":"master","last_synced_at":"2024-06-19T03:04:20.060Z","etag":null,"topics":["deprecated"],"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/JuliaGraphs.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,"governance":null,"roadmap":null,"authors":null}},"created_at":"2015-10-30T14:17:15.000Z","updated_at":"2023-01-28T21:33:49.000Z","dependencies_parsed_at":"2023-05-18T18:15:47.400Z","dependency_job_id":null,"html_url":"https://github.com/JuliaGraphs/Networks.jl","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/JuliaGraphs/Networks.jl","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaGraphs%2FNetworks.jl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaGraphs%2FNetworks.jl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaGraphs%2FNetworks.jl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaGraphs%2FNetworks.jl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JuliaGraphs","download_url":"https://codeload.github.com/JuliaGraphs/Networks.jl/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JuliaGraphs%2FNetworks.jl/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28432621,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T18:57:19.464Z","status":"ssl_error","status_checked_at":"2026-01-14T18:52:48.501Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["deprecated"],"created_at":"2026-01-14T19:30:54.721Z","updated_at":"2026-01-14T19:30:55.182Z","avatar_url":"https://github.com/JuliaGraphs.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Networks\n\n**(NOTE: AS OF 20170729, THIS PACKAGE IS NO LONGER BEING MAINTAINED. Users of this package are encouraged to migrate to\n[MetaGraphs.jl](https://github.com/JuliaGraphs/MetaGraphs.jl).**\n\n[![Build Status](https://travis-ci.org/JuliaGraphs/Networks.jl.svg?branch=master)](https://travis-ci.org/JuliaGraphs/Networks.jl)\n[![codecov.io](http://codecov.io/github/JuliaGraphs/Networks.jl/coverage.svg?branch=master)](http://codecov.io/github/JuliaGraphs/Networks.jl?branch=master)\n[![](https://img.shields.io/badge/docs-latest-blue.svg)](https://juliagraphs.github.io/Networks.jl/latest)\n\n\n**Networks.jl** is a Julia package that extends the basic graph types of [LightGraphs.jl](https://github.com/JuliaGraphs/LightGraphs.jl) to also store graph/vertex/edge properties.\n\n## Installation\n```julia\nPkg.clone(\"https://github.com/JuliaGraphs/Networks.jl\")\n```\n## Usage\nThe types `Net` and `DiNet` are the two ready-to-use network types, for undirected and directed networks respectively. They are able to store any number of graph/vertex/edge properties of any type. It is based on a dictionary of dictionaries\nstructures.\n\n```julia\nusing Networks\nusing LightGraph\n\nn = Net(10)\nnv(n) == 10 # number of vertices\nne(n) == 0 # number of edges\n\n#vertex properties\nadd_vertex!(n, label=\"pino\", weight=2.1)\ngetprop(n, 11, :label) == \"pino\"\nsetprop!(n, 2, label=\"rose\")\n\n#edge properties\nadd_edge!(n, 1, 2, width=10)\nsetprop!(n, Edge(1,2), label=\"violet\", a = \"b\")\ngetprop(n, 1, 2, :width) == 10\ngetprop(n, 1, 2, :a) == \"b\"\n\nnv(n) == 11 # number of vertices\nne(n) == 1 # number of edges\n\n# graph properties\nsetprop!(n, name=\"mynetwork\", id=1)\ngetprop(n, :name) == \"mynetwork\"\n\n# construct from LightGraphs graphs\nn = Net(CompleteGraph(10, 10))\nn = DiNet(DiGraph(10, 20)) # random graph with 10 vertices and 20 edges\n```\nIf you are looking for a more specialized and eventually more performant data structure, take a look to the `(Di)Network` type.\n\n## Internals\n**Networks.jl** is a Julia package for supporting Graphs with vertex and edge properties.\n\nThis includes weighted graphs, labeled vertices, categories edges.\nThe idea is to support graphs through the Adjacency List storage format provided in the LightGraphs.Graph (undirected) and LightGraphs.DiGraph (directed) graph types.\nThis is achieved by encapsulation of the LightGraphs.Graph type. Goals of this project are to be simple, performant, and flexible in that order.\nThis is similar to the LightGraphs.jl philosophy but with the understanding that applications of networks are much more diverse than a simple graph datastructure.\n\nThe idea is that any Network can be converted into a graph by forgetting the properties.\nThus `convert(Graph, net::Network)` are defined for for both `Graph` and `DiGraph`.\nIf combined with default definitions of the graph functions such as `fadj` that do conversion before calling the \"real\"\n definition then one can use `Network` as a graph transparently.\n\nFor example: `fadj(g::Any) = fadj(convert(SimpleGraph, g))` allows one to call `fadj` on an arbitrary network and get\nthe forward adjacency list.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuliagraphs%2Fnetworks.jl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjuliagraphs%2Fnetworks.jl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuliagraphs%2Fnetworks.jl/lists"}