{"id":25171783,"url":"https://github.com/basemax/binarytreediagramdrawing","last_synced_at":"2025-07-01T16:09:11.049Z","repository":{"id":151535225,"uuid":"239366144","full_name":"BaseMax/BinaryTreeDiagramDrawing","owner":"BaseMax","description":"A software to analyze a octal number and generate formula to produce graph. (Phd Project in mathematics field, Article)","archived":false,"fork":false,"pushed_at":"2020-05-27T10:47:29.000Z","size":161,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-06-30T22:47:35.042Z","etag":null,"topics":["math","math-article","math-research","mathematics","phd","python"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/BaseMax.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,"zenodo":null}},"created_at":"2020-02-09T20:03:49.000Z","updated_at":"2020-06-05T22:32:22.000Z","dependencies_parsed_at":"2023-07-10T14:01:19.070Z","dependency_job_id":null,"html_url":"https://github.com/BaseMax/BinaryTreeDiagramDrawing","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BaseMax/BinaryTreeDiagramDrawing","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeDiagramDrawing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeDiagramDrawing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeDiagramDrawing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeDiagramDrawing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/BinaryTreeDiagramDrawing/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FBinaryTreeDiagramDrawing/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262996463,"owners_count":23396903,"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":["math","math-article","math-research","mathematics","phd","python"],"created_at":"2025-02-09T09:22:04.747Z","updated_at":"2025-07-01T16:09:11.042Z","avatar_url":"https://github.com/BaseMax.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binary Tree Diagram Drawing (Math Graph)\n\n## Phd Math Project\n\nA software to analyze a octal number and generate formula to produce graph. (Phd Project in mathematics field, Article)\n\nI'm supervisor of this software to help in this research. (It will publish as article)\n\n#### New version of software available at [here (Binary Tree Diagram)](https://github.com/BaseMax/BinaryTreeDiagram).\n\nIt's a research to write a paper.\n\n![screenshot2.jpg](screenshot2.jpg)\n\n## Process\n\n- Get octal number.\n- Convert number to binary (base 2).\n- Compare binary data to generate new matrix.\n- Compare binary data to generate formula.\n- Check formula to detect their edge is dotted or solid.\n\n![screenshot1.jpg](screenshot1.jpg)\n\n## Using\n\nRun `python process.py`.\n\n## Example\n\n- Step1: [[0, 0, 1], [0, 1, 1], [0, 1, 0]]\n- Step2: [[0, -1, 1], [0, -1, -1], [0, 1, -1]]\n- Step3: [[\"x'\", 'z'], [\"x'\", 'y']]\n- Step4: [[\"x'\", 'z', 0], [\"x'\", 'y', 0]]\n\n0 means dotted, 1 means solid\n\n---------\n\n# Max Base\n\nMy nickname is Max, Programming language developer, Full-stack programmer. I love computer scientists, researchers, and compilers. ([Max Base](https://maxbase.org/))\n\n## Asrez Team\n\nA team includes some programmer, developer, designer, researcher(s) especially Max Base.\n\n[Asrez Team](https://www.asrez.com/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fbinarytreediagramdrawing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Fbinarytreediagramdrawing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fbinarytreediagramdrawing/lists"}