Explore projects

After giving a undirected graph and two vertexs, the program would output the shortest path between these two vertexs.

Use the minisat to solve the vertex cover problem, and use another two approximation apporaches to test the runtime and ratio.

Path Tracer