The Algorithms Interest Group
Introduction
Last updated
Was this helpful?
Introduction
Last updated
Was this helpful?
Lecturer: Steve Yan
Location: Macao Polytechnic Institute
Time Schedule: TBA
Clone via HTTPS using following command or Click Code then Download ZIP.
Attandance
Assignments
This lecture will specifically focus on the Algorithm implementation. My example code will be demonstrated in Python, but you can adopt any kind of programming language if you prefer.
No slides are distributed (cuz. I do not regard slides as an efficient format to display codes) but all of the codes and explanations are shown on this README.md.
The following topics will be covered in the Interest Group
Fundamental Methodologies
Linear Structure
Generic Tree
Linear Structure (maintained by Tree) (由树维护的线性结构)
Generic Graph
Graph Theory (图论)
Multiple Source Shortest Path - I (多源最短路径)
Shortest Path - II (单源最短路径)
Network Flow (网络流)
Bipartite Graph (二分图)
Here are some useful tools for coding. I will briefly introduce them as follows:
Vim is a highly efficient code editor in the command line. I will use vim to implement the code of algorithms in this lecture. You can try to use it with ease because I will specifically introduce some shortcuts and modes of vim. But you are free to adopt any IDEs or text editor you like. You can install it by command:
Typora:
LeetCode:
POJ:
You can open README.md (Markdown File: open via or notepad.exe) locally or on page.
C++ is essential for Algorithms Development due to its high efficiency of execution. However, it is not as easy as the Python language in implementation. In this Interest Group, we adopted C++ in Algorithm design. You are welcome to set this website as a favorite to visit at any time. No slides will be distributed in this lecture, you are free to copy or share the codes on this website. All the contents are under the license.
Demo at
LeetCode in . It is a good platform for elementary algorithms learning. It is appropriate for preparing for a job as well as learning algorithms.
If you do not have a LeetCode account, please visit or to create an account.
