This article presents how to calculate a minimum spanning tree with the Python package, NetworkX.
This article presents how to calculate a maximal independent set with the Python package, NetworkX.
This article introduces simple regression analysis illustrated with a simple example and shows how to calculate it using Python.
It is believed that the minimum connected dominating set problem cannot be solved in polynomial time. To the best of my knowledge, there is no source code available for approximation algorithms. Therefore, I decide to implement one proposed by M. Rai in 2009.
This blog takes notes of dominating sets and shows how to calculate its value with the Python package, NetworkX.
再次读了《Math, Better Explained: Learn to Unlock Your Math Intuition》虚数部分，这次做点笔记。
本文试图直观理解数学常数e，包括4种e常见定义的直观解释，自然对数，指数。 Read more