{"id":19844385,"url":"https://github.com/rohankalbag/optivlsi","last_synced_at":"2026-03-05T03:31:35.788Z","repository":{"id":115483761,"uuid":"603061918","full_name":"rohankalbag/optiVLSI","owner":"rohankalbag","description":"A library for fast and optimized VLSI Computer-Aided-Design algorithms","archived":false,"fork":false,"pushed_at":"2023-05-08T17:50:00.000Z","size":95363,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-01T17:54:02.026Z","etag":null,"topics":["automan","binary-decision-diagram","graph-algorithms","logic-simulator","numba-jit","python","vlsi-cad"],"latest_commit_sha":null,"homepage":"","language":"Python","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/rohankalbag.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-02-17T14:39:57.000Z","updated_at":"2024-11-01T16:58:38.000Z","dependencies_parsed_at":null,"dependency_job_id":"e0472229-b75e-447a-a610-f92de231686c","html_url":"https://github.com/rohankalbag/optiVLSI","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rohankalbag/optiVLSI","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohankalbag%2FoptiVLSI","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohankalbag%2FoptiVLSI/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohankalbag%2FoptiVLSI/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohankalbag%2FoptiVLSI/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rohankalbag","download_url":"https://codeload.github.com/rohankalbag/optiVLSI/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohankalbag%2FoptiVLSI/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30108611,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-05T01:39:18.192Z","status":"online","status_checked_at":"2026-03-05T02:00:06.710Z","response_time":93,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["automan","binary-decision-diagram","graph-algorithms","logic-simulator","numba-jit","python","vlsi-cad"],"created_at":"2024-11-12T13:03:56.273Z","updated_at":"2026-03-05T03:31:35.781Z","avatar_url":"https://github.com/rohankalbag.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# OptiVLSI\n\n*Very Large Scale Integration abbreviated as VLSI involves digital circuits dealing with billions of transistors, and\nrequires computerized design automation, design verification and testing algorithms. Digital circuits are often\nrepresented using graphs, where the logic gates are nodes and their interconnections are the edges. Since VLSI\ncircuits have millions of logic gates, there is a need for fast and highly optimized graph algorithms. There are a\nfew optimized graph libraries with optimized basic graph operations such as `networkx`, but there are no optimized\nand high performance open source libraries which build upon these to specifically cater to the VLSI computer\naided design automation industry.*\n\n\n## Initially Implemented Optimised Implementations/Algorithms (Documentation can be found [here](https://github.com/rohankalbag/optiVLSI/blob/main/OptiVLSI.pdf))\n\n- [Lee Algorithm](https://github.com/rohankalbag/optiVLSI/tree/main/lee-algorithm)\n- [Kruskal's Algorithm](https://github.com/rohankalbag/optiVLSI/tree/main/kruskal)\n- [Binary Decision Diagrams](https://github.com/rohankalbag/optiVLSI/tree/main/ROBDD)\n- [Bellman-Ford Algorithm](https://github.com/rohankalbag/optiVLSI/tree/main/bellman-ford)\n- [Prim Algorithm](https://github.com/rohankalbag/optiVLSI/tree/main/prim)\n- [Dijkstra's Algorithm](https://github.com/rohankalbag/optiVLSI/tree/main/dijkstra)\n- [Compiled Code Simulator](https://github.com/rohankalbag/optiVLSI/tree/main/compiled-code-simulator)\n- [Event Driven Simulator](https://github.com/rohankalbag/optiVLSI/tree/main/event-driven-sim)\n\n### Optimization Tools Used\n- Numba: All the algorithms that are implemented have been accelerated using numba and their runtimes have\nbeen compared with pythonic and other implementations\n- Automan: To automate simulations, benchmark algorithms, several circuits/graphs of varying sizes were used\nand results for the same were generated using automan\n\n\n##### This open-source codebase started as a course project for the course offered at IIT Bombay, AE6102 - Parallel Scientific Computing and Visualization. We are open to more open-source contributions\n\n### Collaborators\n- Rohan Rajesh Kalbag\n- Neeraj Prabhu\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frohankalbag%2Foptivlsi","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frohankalbag%2Foptivlsi","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frohankalbag%2Foptivlsi/lists"}