Mondrian
\
Trismegiste
Mondrian
Algebra
Analysis
Strategy
Builder
Compiler
Statement
Command
Config
Graph
Parser
Plugin
Refactor
Transform
Format
Logger
Vertex
Visitor

\Trismegiste\Mondrian\GraphPrettyPrint

PrettyPrint is Decorator for pretty printing a graph

Algorithm is an algorithm on Graph. This class does nothing except wrapping the graph. It is intended to avoid copy/paste of this content for real algorithms. See it as a default implementation. Therefore you only need to subclass this decorator and add your methods.

It is not abstract since I want to test it but the spirit is :)

Summary

Methods
Properties
Constants
__construct()
addEdge()
addVertex()
getEdgeSet()
getVertexSet()
searchEdge()
getSuccessor()
getEdgeIterator()
getPartition()
__toString()
No public properties found
No constants found
No protected methods found
$graph
N/A
extractShortName()
No private properties found
N/A

Properties

$graph

$graph :

Type

Methods

getEdgeSet()

getEdgeSet() : array

Get the edges set

Returns

array

getVertexSet()

getVertexSet() : array

Get the vertices in the graph

Returns

array

getSuccessor()

getSuccessor(\Trismegiste\Mondrian\Graph\Vertex  $v) : null|array

Get successors of a vertex

Parameters

\Trismegiste\Mondrian\Graph\Vertex $v

Returns

null|array —

null if the vertex is not in this graph

                    or an array of vertices

getEdgeIterator()

getEdgeIterator(\Trismegiste\Mondrian\Graph\Vertex  $v) : \Trismegiste\Mondrian\Graph\Iterator

Get an iterator on edges for one vertex

Parameters

\Trismegiste\Mondrian\Graph\Vertex $v

Returns

\Trismegiste\Mondrian\Graph\Iterator

getPartition()

getPartition()

Returns a list of subgraph

__toString()

__toString()