{"id":15632755,"url":"https://github.com/kirilldanshin/tree-traversal-example","last_synced_at":"2025-03-29T19:20:44.177Z","repository":{"id":92847331,"uuid":"192570582","full_name":"kirillDanshin/tree-traversal-example","owner":"kirillDanshin","description":"Simple example of three ways to traverse a tree/graph with infinite nesting","archived":false,"fork":false,"pushed_at":"2019-06-18T15:57:25.000Z","size":14,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2023-02-28T23:32:43.962Z","etag":null,"topics":["example","golang","traversal","tree","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kirillDanshin.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":"2019-06-18T15:49:19.000Z","updated_at":"2024-06-19T07:52:58.648Z","dependencies_parsed_at":"2023-04-26T14:46:06.732Z","dependency_job_id":null,"html_url":"https://github.com/kirillDanshin/tree-traversal-example","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kirillDanshin%2Ftree-traversal-example","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kirillDanshin%2Ftree-traversal-example/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kirillDanshin%2Ftree-traversal-example/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kirillDanshin%2Ftree-traversal-example/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kirillDanshin","download_url":"https://codeload.github.com/kirillDanshin/tree-traversal-example/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246231514,"owners_count":20744506,"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":["example","golang","traversal","tree","tree-structure"],"created_at":"2024-10-03T10:45:11.596Z","updated_at":"2025-03-29T19:20:44.160Z","avatar_url":"https://github.com/kirillDanshin.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# tree traversal example\n\nA simple tree traversal example.\n\n# Usage\n```\n-f, --filepath string     json file path\n-g, --generateNodes int   generate N nodes and write to a given filepath\n-p, --parallel            enable parallel method. uses waitgroup in each method\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkirilldanshin%2Ftree-traversal-example","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkirilldanshin%2Ftree-traversal-example","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkirilldanshin%2Ftree-traversal-example/lists"}