Thanks to visit codestin.com
Credit goes to github.com

Skip to content
View dolyg's full-sized avatar
  • Taiyuan University of technology

Block or report dolyg

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
dolyg/README.md

你好,我是 dolyg!👋

🎓 学生 | 算法爱好者 | EDA 探索者


🧑‍💻 关于我

  • 我是一名热爱算法研究的学生,喜欢开发各种有趣的小工具。
  • 最感兴趣的领域是 EDA(电子设计自动化)工具及其背后的算法原理
  • 熟悉 C/C++Python 的面向对象编程,对EDA划分、综合等算法有研究和实践经验。
  • 空闲时喜欢跑步,享受思考和运动带来的乐趣。

🚀 代表项目

高效的 EDA 划分算法项目,专注于电子设计自动化领域的创新与探索。


🛠️ 技能栈

  • 编程语言: C/C++、Python
  • 编程范式: 面向对象编程
  • 专业方向: EDA 算法、划分与综合、算法实现与优化

📌 其他有趣项目


💡 个人标签

喜欢跑步,用运动保持思维敏捷!


感谢你的访问!⭐️


Hi, I'm dolyg! 👋

🎓 Student | Algorithm Enthusiast | EDA Explorer


🧑‍💻 About Me

  • I’m a student who loves exploring algorithms and building fun little tools.
  • My main interests are in EDA (Electronic Design Automation) tools and their underlying algorithms.
  • Skilled in C/C++ and Python object-oriented programming, with research and practical experience in EDA partitioning, synthesis, and related algorithms.
  • In my spare time, I enjoy running and keeping my mind sharp through both exercise and problem-solving.

🚀 Top Project

An efficient EDA partitioning algorithm project, focusing on innovation and exploration in the field of electronic design automation.


🛠️ Skills

  • Languages: C/C++, Python
  • Paradigms: Object-Oriented Programming
  • Specialties: EDA algorithms, partitioning & synthesis, algorithm implementation & optimization

📌 Other Interesting Projects


💡 Fun Fact

I love running — it keeps both my body and my mind energized!


Thanks for visiting! ⭐️

Pinned Loading

  1. Topopart_plus Topopart_plus Public

    It's my implemental topopart+ with 2024EDAcompetition http://eda.icisc.cn/

    C++ 2 1

  2. The-destructive-problem-of-C-n-k-network The-destructive-problem-of-C-n-k-network Public

    This is a theoretical conclusion that the complete coverage problem of the C(n,k) network destruction problem can be transformed into an exact matching, which is written in the report.