1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162 |
- <?php
- use Graphp\Algorithms\Groups as AlgorithmGroups;
- use Fhaculty\Graph\Graph;
- class GroupsTest extends TestCase
- {
- public function testGraphEmpty()
- {
- $graph = new Graph();
- $alg = new AlgorithmGroups($graph);
- $this->assertEquals(array(), $alg->getGroups());
- $this->assertEquals(0, $alg->getNumberOfGroups());
- $this->assertTrue($alg->getVerticesGroup(123)->isEmpty());
- $this->assertFalse($alg->isBipartit());
- }
- public function testGraphPairIsBipartit()
- {
- // 1 -> 2
- $graph = new Graph();
- $v1 = $graph->createVertex(1)->setGroup(1);
- $v2 = $graph->createVertex(2)->setGroup(2);
- $v1->createEdgeTo($v2);
- $alg = new AlgorithmGroups($graph);
- $this->assertEquals(array(1, 2), $alg->getGroups());
- $this->assertEquals(2, $alg->getNumberOfGroups());
- $this->assertTrue($alg->getVerticesGroup(123)->isEmpty());
- $this->assertEquals(array(1 => $v1), $alg->getVerticesGroup(1)->getMap());
- $this->assertTrue($alg->isBipartit());
- }
- public function testGraphTriangleCycleIsNotBipartit()
- {
- // 1 -> 2 -> 3 -> 1
- $graph = new Graph();
- $v1 = $graph->createVertex(1)->setGroup(1);
- $v2 = $graph->createVertex(2)->setGroup(2);
- $v3 = $graph->createVertex(3)->setGroup(1);
- $v1->createEdgeTo($v2);
- $v2->createEdgeTo($v3);
- $v3->createEdgeTo($v1);
- $alg = new AlgorithmGroups($graph);
- $this->assertEquals(array(1, 2), $alg->getGroups());
- $this->assertEquals(2, $alg->getNumberOfGroups());
- $this->assertTrue($alg->getVerticesGroup(123)->isEmpty());
- $this->assertEquals(array(1 => $v1, 3 => $v3), $alg->getVerticesGroup(1)->getMap());
- $this->assertFalse($alg->isBipartit());
- }
- }
|