{"id":18772252,"url":"https://github.com/valyaevgeorgiy/networkx_models","last_synced_at":"2026-05-03T05:37:01.593Z","repository":{"id":170654473,"uuid":"618614391","full_name":"Valyaevgeorgiy/NetworkX_models","owner":"Valyaevgeorgiy","description":"Изучение логики работы сетевых моделей","archived":false,"fork":false,"pushed_at":"2023-05-29T18:36:23.000Z","size":10715,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-14T08:15:27.367Z","etag":null,"topics":["graphs-algorithms","graphs-theory","metro","network","python"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Valyaevgeorgiy.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-03-24T21:35:43.000Z","updated_at":"2023-03-24T21:40:41.000Z","dependencies_parsed_at":null,"dependency_job_id":"c6779c3c-b52f-49ce-8e03-c700e3570191","html_url":"https://github.com/Valyaevgeorgiy/NetworkX_models","commit_stats":null,"previous_names":["valyaevgeorgiy/networkx_models"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Valyaevgeorgiy/NetworkX_models","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Valyaevgeorgiy%2FNetworkX_models","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Valyaevgeorgiy%2FNetworkX_models/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Valyaevgeorgiy%2FNetworkX_models/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Valyaevgeorgiy%2FNetworkX_models/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Valyaevgeorgiy","download_url":"https://codeload.github.com/Valyaevgeorgiy/NetworkX_models/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Valyaevgeorgiy%2FNetworkX_models/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32559716,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-03T03:21:47.309Z","status":"ssl_error","status_checked_at":"2026-05-03T03:21:43.884Z","response_time":103,"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":["graphs-algorithms","graphs-theory","metro","network","python"],"created_at":"2024-11-07T19:28:18.986Z","updated_at":"2026-05-03T05:37:01.576Z","avatar_url":"https://github.com/Valyaevgeorgiy.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NetworkX_models\n\nПогружение в работу и основные алгоритмы функционирования современных сетевых моделей с пониманием теории графов и взаимодействием с графами через библиотеки Python (networkX \u0026 igraph).\n\n- [Introducing](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/Introducing) — знакомство с теорией графов и сетевыми алгоритмами в Excel.\n- [Graphs](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_graphs) — построение минимального остовного дерева с множеством дополнительных условий и итераций.\n- [Metro structure](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_metro) — реализация графовой структуры одной из современных сетей станций метро (на примере метро Санкт-Петербурга) в целях распространения сети точек питания с определённым временным условием доставки заказа до клиента.\n- [Life game](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_life_game) — построение на графе структуры клеточного автомата с дальнейшей реализацией логики работы игры «Жизнь».\n- [Graph destruction](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_destruction_graph) — выделение главных структурных характеристик графа с дальнейшим проведением процедуры его структурного разрушения при помощи дополнительной визуализации процесса.\n- [Stock graph](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_stock_graph) — построение рыночного графа акций российских компаний с дальнейшим нахождением кликов с указанными компаниями (акциями), соответствующими вершинам клики, а также заполнение итоговой таблицы по расчётным пороговым значениям коэффициента корреляции.\n- [Multicriterial optimization](https://github.com/Valyaevgeorgiy/NetworkX_models/tree/main/networkX_mult_optimization) — решение транспортно-логистической задачи перемещения продукции в рамках мультикритериальной оптимизации процесса (на примере задания с 2 критериями — время и стоимость поставки) с визуализацией Паретовского множества и множества альтернатив у ориентированного графа.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvalyaevgeorgiy%2Fnetworkx_models","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvalyaevgeorgiy%2Fnetworkx_models","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvalyaevgeorgiy%2Fnetworkx_models/lists"}