\Trismegiste\Mondrian\GraphFloydWarshall

__construct()

__construct(\Trismegiste\Mondrian\Graph\Graph  $g) 

Decorates the graph

Parameters

addEdge()

addEdge(\Trismegiste\Mondrian\Graph\Vertex  $source, \Trismegiste\Mondrian\Graph\Vertex  $target) 

Add a (un)directed edge if it does not already exist

Parameters

addVertex()

addVertex(\Trismegiste\Mondrian\Graph\Vertex  $v) 

Add a vertex to the graph without edge

Parameters

getEdgeSet()

getEdgeSet() : array

Get the edges set

Returns

getVertexSet()

getVertexSet() : array

Get the vertices in the graph

Returns

searchEdge()

searchEdge(\Trismegiste\Mondrian\Graph\Vertex  $source, \Trismegiste\Mondrian\Graph\Vertex  $target) : \Trismegiste\Mondrian\Graph\Edge

Searches an existing (directed or not) edge between two vertices

Parameters

Returns

getSuccessor()

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

Get successors of a vertex

Parameters

Returns

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

Returns

getPartition()

getPartition() 

Returns a list of subgraph

getDistance()

getDistance()