%PDF- %PDF-
Mini Shell

Mini Shell

Direktori : /home/tjamichg/cursos.tjamich.gob.mx/vendor/graphp/algorithms/tests/
Upload File :
Create Path :
Current File : /home/tjamichg/cursos.tjamich.gob.mx/vendor/graphp/algorithms/tests/CompleteTest.php

<?php

use Fhaculty\Graph\Graph;
use Graphp\Algorithms\Complete as AlgorithmComplete;

class CompleteTest extends TestCase
{
    public function testGraphEmptyK0()
    {
        $graph = new Graph();

        $alg = new AlgorithmComplete($graph);

        $this->assertTrue($alg->isComplete());
    }

    public function testGraphSingleTrivialK1()
    {
        $graph = new Graph();
        $graph->createVertex(1);

        $alg = new AlgorithmComplete($graph);

        $this->assertTrue($alg->isComplete());
    }

    public function testGraphSimplePairK2()
    {
        // 1 -- 2
        $graph = new Graph();
        $graph->createVertex(1)->createEdge($graph->createVertex(2));

        $alg = new AlgorithmComplete($graph);

        $this->assertTrue($alg->isComplete());
    }

    public function testGraphSingleDirectedIsNotComplete()
    {
        // 1 -> 2
        $graph = new Graph();
        $graph->createVertex(1)->createEdgeTo($graph->createVertex(2));

        $alg = new AlgorithmComplete($graph);

        $this->assertFalse($alg->isComplete());
    }

    public function testAdditionalEdgesToNotAffectCompleteness()
    {
        // 1 -> 2
        // 1 -- 2
        // 2 -> 1
        // 1 -> 1
        $graph = new Graph();
        $graph->createVertex(1)->createEdgeTo($graph->createVertex(2));
        $graph->getVertex(1)->createEdge($graph->getVertex(2));
        $graph->getVertex(2)->createEdgeTo($graph->getVertex(1));
        $graph->getVertex(1)->createEdgeTo($graph->getVertex(1));

        $alg = new AlgorithmComplete($graph);

        $this->assertTrue($alg->isComplete());
    }
}

Zerion Mini Shell 1.0