Skip to content

This assignment is 2018 spring semester for the course named Data Science in NTHU CS. Find a MAX clique for an undirected graph

Notifications You must be signed in to change notification settings

ZheTingLiu/Maximum-Clique

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This assignment is 2018 spring semester for the course named Data Science in NTHU CS.

Goal

  • Find a MAX clique for an undirected graph
  • Use C++ to implement it

Testing environment

  • OS: Windows10
  • Compiler: g++ 5.4.0(C++11)

Data format

  • Input file is a .txt file. The following is the content. A line means one edge. Each edge uses one space to distinguish the ID of two nodes. It means that there is an edge between these two nodes.
   0 1
   0 2
   0 3
   0 4
  • The output file is also a .txt file. The following is the content. Each line represents the ID of one node. The output order is in ascending order.
0
1
2

Operation

  • Use makefile to compile this program. Type this instruction "main.exe inputFileName.txt oututFileName.txt" in the cmd.
  • The program will be terminated if the execution time is over 3 minutes or it finds the MAX clique.

About

This assignment is 2018 spring semester for the course named Data Science in NTHU CS. Find a MAX clique for an undirected graph

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published