{"id":21474773,"url":"https://github.com/okayama-daiki/algorithm-design","last_synced_at":"2025-06-10T09:04:02.896Z","repository":{"id":184627650,"uuid":"672205604","full_name":"okayama-daiki/algorithm-design","owner":"okayama-daiki","description":"A shared repository for study group","archived":false,"fork":false,"pushed_at":"2024-01-13T13:05:32.000Z","size":8308,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-03-17T07:45:40.778Z","etag":null,"topics":["algorithm-design","algorithms"],"latest_commit_sha":null,"homepage":"","language":"C","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/okayama-daiki.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-07-29T09:20:45.000Z","updated_at":"2024-01-13T13:09:34.000Z","dependencies_parsed_at":"2023-12-03T06:20:07.558Z","dependency_job_id":"44386c32-93fd-40aa-965a-3f033405d839","html_url":"https://github.com/okayama-daiki/algorithm-design","commit_stats":null,"previous_names":["dike-okayama/algorithm-design","okayama-daiki/algorithm-design"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/okayama-daiki%2Falgorithm-design","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/okayama-daiki%2Falgorithm-design/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/okayama-daiki%2Falgorithm-design/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/okayama-daiki%2Falgorithm-design/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/okayama-daiki","download_url":"https://codeload.github.com/okayama-daiki/algorithm-design/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/okayama-daiki%2Falgorithm-design/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259043761,"owners_count":22797159,"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":["algorithm-design","algorithms"],"created_at":"2024-11-23T10:32:18.378Z","updated_at":"2025-06-10T09:04:02.868Z","avatar_url":"https://github.com/okayama-daiki.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# algorithm-design\n\n\u003cimg alt=\"アルゴリズムデザイン\" src=\"https://hondana-image.s3.amazonaws.com/book/image/10010675/0338ac22-2e23-4115-894a-8560632c47f4.jpg\" width=\"300px\"\u003e\n\n## Overview\n\n本リポジトリは、 [_アルゴリズムデザイン_, Jon Kleinberg \u0026 Eva Tardos著, 浅野孝夫 \u0026 浅野泰仁 \u0026 小野孝男 \u0026 平田富夫訳](https://www.kyoritsu-pub.co.jp/book/b10010675.html) の輪読で利用される資料の共有を目的として作成されました。各章で取り上げられる主要な概念やアルゴリズムの要約、コードのサンプル、議論における焦点などが蓄積される、参加者間の共有資源庫です。\n\n## Usage\n\n1. リポジトリをクローンまたは[ダウンロード](https://github.com/okayama-daiki/algorithm-design/archive/refs/heads/main.zip)します\n2. 各章のディレクトリには該当する節の要約やコードサンプルが含まれます\n3. 質問や議論は、 [Issue](https://github.com/okayama-daiki/algorithm-design/issues/new) を使用して行ってください\n\n## How to Participate\n\n輪読会への参加や貢献に興味がある方は、 [Issue](https://github.com/okayama-daiki/algorithm-design/issues/new) でご連絡いただくか、[Pull Request](https://github.com/okayama-daiki/algorithm-design/pulls) をお送りください。\n\n## Past Sessions\n\n以下は本輪読会の開催履歴です。\n\n| 回 | 開催日時 | 輪読範囲 | 発表 |\n| - | - | - | - |\n| 第1回 | 8/5 | [1.1 最初の問題：安定マッチング](./chapter-1/1.1.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第2回 | 8/12 | [1.2 五つの代表的な問題](./chapter-1/1.2.md) | [hamao0820](https://github.com/hamao0820) |\n| 第3回 | 8/15 | [2.1 計算容易性](./chapter-2/2.1.md)\u003cbr\u003e[2.2 増加の漸近的オーダー（p38,漸近的増加率の性質まで）](./chapter-2/2.2.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第4回 | 8/20 | [2.2 増加の漸近的オーダー（p39,基本的な関数の漸近的限界から）](./chapter-2/2.2.md)\u003cbr\u003e[2.3 リストと配列による安定マッチングアルゴリズムの実装](./chapter-2/2.3.md) | [hamao0820](https://github.com/hamao0820) |\n| 第5回 | 8/26 | [2.4 よく現れる計算時間の復習](./chapter-2/2.4.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第6回 | 8/30 | [2.5 より複雑なデータ構造：優先順位付きキュー](./chapter-2/2.5.md) | [hamao0820](https://github.com/hamao0820) |\n| 第7回 | 9/9 | [3.1 基本的定義と応用](./chapter-3/3.1.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第8回 | 9/16 | [3.2 グラフの連結性とグラフ走査](./chapter-3/3.2.md) | [hamao0820](https://github.com/hamao0820) |\n| 第9回 | 9/30 | [3.3 キューとスタックを用いたグラフ走査](./chapter-3/3.3.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第10回 | 10/7 | [3.4 二部グラフ性の判定：幅優先探索の応用](./chapter-3/3.4.md) | [hamao0820](https://github.com/hamao0820) |\n| 第11回 | 11/17 | [3.5 有向グラフの連結性](./chapter-3/3.5.md) | [hamao0820](https://github.com/hamao0820) |\n| 第12回 | 11/25 | [3.6 有向無閉路グラフとトポロジカル順序付け](./chapter-3/3.6.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n| 第13回 | 12/3 | [4.1 区間スケジューリング：グリーディアルゴリズムの先進性](./chapter-4/4.1.md) | [hamao0820](https://github.com/hamao0820) |\n| 第14回| 1/6 | [4.2 遅延最小化スケジュール：交換議論](./chapter-4/4.2.md) | [okayama-daiki](https://github.com/okayama-daiki) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fokayama-daiki%2Falgorithm-design","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fokayama-daiki%2Falgorithm-design","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fokayama-daiki%2Falgorithm-design/lists"}