In this iteration, we will have a functional algorithm at our position.We will test our Algorithm against existing Algorithms that find vertex separator in graph like metis, KaHIP.
In addition, we will be working with system that computes all minimal models of a propositional theory -WASP and test our own theory against it, we will check on same examples and see if there is improvement in run time.

We estimate the work length to be at 4 weeks The software would:

• Create Test class that will read from TEXT file with graph format and then we could test several graph formats. here is issue link
• Make memory tests on find node separator in Graph Algorithm. here is issue link
• Compere my algorithm against KaHIP algorithm. here is issue link
• Make memory usage tests of wasp program. here is issue link
• Compere my algorithm against Metis. here is issue link
• Test find minimal model - 160 Rules. here is issue link
• Test find minimal model - 400 Rules . here is issue link
• Test Graph construction with large set of rules . here is issue link
• Test find minimal model - 1200 Rules and up . here is issue link
• Create NEW method to find node separator as a result of the TESTS . here is issue link

At the end of this iteration, we would have also defined software requirements and also our software design, according Mentors requests.

• After testing with Grid graph issue, Omri had to change algorithm to find node separator issue.Now tests will postpone after construction the new algorithm, and after they will be made on the new algorithm.
• We used Eclipse as our main developing environment. Each of us written his code on his own local machine while we performed the actual merging, building and compiling on a single machine (Eclipse is a resource hog program).

• Adi will work on Rules data structure creation.
• Omri will work on graph data structure creation.

• Graph return set of sources to rules data structure and it find minimal model for set of rules by using davis putnam
• we are able to find minimal module to small set of clauses .
• create method that dismantle Strongest Connected component
• Receive a set of vertexes from graph DS and put values on each vertex- also checks if the values we put in the variables return SAT if so we change rules DS by the values we found and if not we try different values for the variables

link to issues

• User Manual
• Developers-Manual

Omri have to change Theory to the "Theory that use K-edge connected component" to "Finding small balanced separators" link. After test with grid like graph failed to find node separator but return a result with that separate one node each time. Now I implement the new theory and preform test on it.
Our team works very well together, we have via meetings on skype an also have a Whatsapp group and Gitter group , where all the members always stay connected and updated. We also work closely with our mentors and as a result we found a bug after test were done on "K-edge connected component",we Created new method to find node separator.