The implemented Maximal Independent Set (MIS) is based on an iterative method. The algorithm goes several rounds to traverse all vertices to select vertices into an MIS set. For each round, label every available vertex with a random weight. Then, if the weights of the current vertex is the smallest among its neighbours, this vertex is labeled into an MIS set and unlabeled its neighbours at the same time. By running several times of the iteration, all vertexed would be traversed and labeled vertices are grouped into an MIS set. The output is the vertex list of the MIS set.