\Trismegiste\Mondrian\AnalysisUsedCentrality

This tool helps you to find an effect on some components:

The ripple effect One component (class, parameter, method...) can be highly used accross the source code. Each time there is a change in this component, chances are you need to change many other components directly depending on it and so on. That's the ripple. With the "usedRank" method you can view what component is time consuming and can lead to many merge conflicts in Git.

Summary

Methods

Properties

Constants

__construct()
addEdge()
addVertex()
getEdgeSet()
getVertexSet()
searchEdge()
getSuccessor()
getEdgeIterator()
getPartition()
decorate()

No public properties found

No constants found

addCentralityRank()

$graph

N/A

No private methods found

No private properties found

N/A

File: Analysis\UsedCentrality.php
Package: Default
Class hierarchy: \Trismegiste\Mondrian\Graph\Algorithm

\Trismegiste\Mondrian\Analysis\Centrality

\Trismegiste\Mondrian\Analysis\UsedCentrality

Properties

$graph

$graph :

Type

Methods

__construct()

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

Decorates the graph

Parameters

\Trismegiste\Mondrian\Graph\Graph

addEdge()

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

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

Parameters

\Trismegiste\Mondrian\Graph\Vertex	$source
\Trismegiste\Mondrian\Graph\Vertex	$target

addVertex()

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

Add a vertex to the graph without edge

Parameters

\Trismegiste\Mondrian\Graph\Vertex

getEdgeSet()

getEdgeSet() : array

Get the edges set

Returns

array

getVertexSet()

getVertexSet() : array

Get the vertices in the graph

Returns

array

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

\Trismegiste\Mondrian\Graph\Vertex	$source
\Trismegiste\Mondrian\Graph\Vertex	$target

Returns

\Trismegiste\Mondrian\Graph\Edge

getSuccessor()

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

Get successors of a vertex

Parameters

\Trismegiste\Mondrian\Graph\Vertex

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

Returns

\Trismegiste\Mondrian\Graph\Iterator

getPartition()

getPartition()

Returns a list of subgraph

decorate()

decorate()

Add used centrality information on each vertex (edge effect on this digraph)

addCentralityRank()

addCentralityRank(\Trismegiste\Mondrian\Graph\Graph  $g, string  $metaName)

General method to calculate centrality with the power iteration algo

Parameters

\Trismegiste\Mondrian\Graph\Graph	$g
string	$metaName	the key of the metadata name to set in vertices