Physics and Python stuff. Most of the videos here are either adapted from class lectures or solving physics problems. I ...

Abstract: A k-vertex cut problem aims to find a minimum subset of nodes whose removal decomposes a graph into at least k connected components, which belongs to the family of critical node detection ...

Abstract: This research is conducted to design and develop a new algorithm for finding out the classic “Shortest Path” between every pair of vertices using an atypical approach. The approach follows ...