Uses of Interface
bcds.phison.SimGraph

Packages that use SimGraph

bcds.phison	This package defines essential graph entities, such as nodes, links and paths.
bcds.phison.alg	This package contains implementations of basic graph algorithms, for example, for finding connected components, and minimum max-flows between node pairs.
bcds.phison.clustering
bcds.phison.gm	Classes in this package extract measurable properties of a graph, its nodes or links.
bcds.phison.io	Classes in this package deal with reading or writing files (topologies in different formats, demand type defintions, zone maps, etc.).
bcds.phison.multfailures
bcds.phison.ra	The routing algorithm (ra) package defines the interface expected by the Phison simulator and implements several well-known routing algorithms, such as Dijkstra, WSP and SWP.
bcds.phison.sim	This package comprises the simulator and several processing modules.

Uses of SimGraph in bcds.phison

Classes in bcds.phison that implement SimGraph

class

SdiGraph<V,E> Implements a directed graph in which parallel edges are not allowed (though loops are).

Fields in bcds.phison declared as SimGraph

SimGraph<V,E>

Path.g The SimGraph to which this path is bound.

Methods in bcds.phison that return SimGraph

static <V,E> SimGraph<V,E>	GraphUtil.asUndirectedGraph(SimGraph<V,E> g) Returns a new subgraph in which the edges are only those considered as canonic in the graph g.
SimGraph<V,E>	SimGraph.createSubgraph(java.util.Set<V> vertex_subset, java.util.Set<E> edge_subset) Creates a new graph consisting of a subset of this graphs's edges and vertices.
static <V,E> SimGraph<V,E>	GraphUtil.filterOutBidiLinks(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the edges of path do not appear.
static <V,E> SimGraph<V,E>	GraphUtil.filterOutIntermediateNodes(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the non-end of path are absent.
static <V,E> SimGraph<V,E>	GraphUtil.newGraph(java.lang.Class<V> node_cls, java.lang.Class<E> link_cls) Creates a new graph whose nodes and links will be of the given types.

Methods in bcds.phison with parameters of type SimGraph

static <V,E> double	GraphUtil.assortativity(SimGraph<V,E> g) Returns graph's assortativity coefficient.
static <V,E> SimGraph<V,E>	GraphUtil.asUndirectedGraph(SimGraph<V,E> g) Returns a new subgraph in which the edges are only those considered as canonic in the graph g.
static <V,E> java.util.Map<SimplePair<V,V>,java.lang.Double>	GraphUtil.booleanRandomTrafficMatrix(SimGraph<V,E> g, java.util.Random rnd) Generates a random traffic matrix consisting of 0s and 1s.
static <V,E> E	GraphUtil.canonicEdge(SimGraph<V,E> g, E e) Deprecated. It is better to use g.canonicEdge(e) directly.
static <V,E> java.util.Map<V,java.lang.Float>	GraphUtil.clusteringCoefficients(SimGraph<V,E> g) Deprecated. New code should use the ClusteringCoeff class directly.
static <V,E> java.util.Map<E,java.lang.Double>	GraphUtil.constantEdgeCost(SimGraph<V,E> g, double c) Returns a HashMap in which the keys are the edges of graph g, all of them with value c.
static <V extends GraphIONode,E> GraphReader<V,E>	GraphUtil.createGraphReader(java.lang.String fname, SimGraph<V,E> g) Instantiates a new graph reader based on the filename extension.
static <V extends GraphIONode,E> GraphWriter<V,E>	GraphUtil.createGraphWriter(java.io.PrintStream out, java.lang.String ftype, SimGraph<V,E> g) Creates a GraphWriter tied to a java.io.PrintStream object.
static <V extends GraphIONode,E> GraphWriter<V,E>	GraphUtil.createGraphWriter(java.lang.String fname, SimGraph<V,E> g) Instantiates a new graph writer based on the filename extension.
static <V extends GraphIONode,E> GraphWriter<V,E>	GraphUtil.createGraphWriter(java.io.Writer out, java.lang.String ftype, SimGraph<V,E> g) Creates a GraphWriter tied to a java.io.Writer object.
static <V extends GraphIONode,E> java.util.Map<java.lang.String,java.lang.String>	GraphUtil.createNodeLabelToIdMap(SimGraph<V,E> g) Returns a HashMap that associats node labels to node ids, as in ("Athens" : 0), ("Berlin" : 14), etc.
static <V,E> void	GraphUtil.fillWithLatticeTopology(SimGraph<V,E> g, int num_rows, int num_cols) Removes all the links and nodes in the graph g and inserts new ones so that the result is a two-dimensional grid topology (a lattice).
static <V,E> void	GraphUtil.fillWithRingTopology(SimGraph<V,E> g, int num_nodes) Removes all the links and nodes in the graph g and inserts new ones so that the result is ring topology.
static <V,E> SimGraph<V,E>	GraphUtil.filterOutBidiLinks(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the edges of path do not appear.
static <V,E> SimGraph<V,E>	GraphUtil.filterOutIntermediateNodes(SimGraph<V,E> g, Path<V,E> path) Returns a subgraph in which the non-end of path are absent.
static <V,E> boolean	GraphUtil.isStronglyConnected(SimGraph<V,E> g) Returns true if g is a strongly-connected graph and false otherwise.
static <V,E> java.lang.Object[]	GraphUtil.networkDiameter(SimGraph<V,E> g) Returns information about the network diameter and shortest path lengths when the link cost is 1, that is, when path length is measured in number of hops.
static <V,E,N extends java.lang.Number> java.lang.Object[]	GraphUtil.networkDiameter(SimGraph<V,E> g, java.util.Map<E,N> cost) Computes the network diameter and the average path length, and returns information about these two measures in an array.
static <V,E> FreqTable<java.lang.Integer>	GraphUtil.nodalDegreeFreq(SimGraph<V,E> g) Returns the frequency distribution of the nodal degrees of the graph g.
static <V,E> boolean	GraphUtil.pathContainsBidiLink(SimGraph<V,E> g, E e, Path<V,E> path) Returns true if path contains the link e, either as e itself or as reverse(e).
static <V,E> E	GraphUtil.reverseEdge(SimGraph<V,E> g, E e) Deprecated. Better use g.reverseEdge() directly.
static <V,E> float	GraphUtil.twoTerminalReliability(SimGraph<V,E> g) Returns the average two-terminal reliability.

Constructors in bcds.phison with parameters of type SimGraph

NetAvail(SimGraph<V,E> g, java.util.Map<E,java.lang.Double> dist, ZoneMap<V,E> za)

NodePairsTrig(SimGraph<V,E> g)

Path(SimGraph<V,E> g)
Construct a new path bound to a given SimGraph.

Uses of SimGraph in bcds.phison.alg

Methods in bcds.phison.alg with parameters of type SimGraph

static <V,E> ConnectedComponents<V,E>

ConnectedComponents.make(SimGraph<V,E> g) A convenience constructor.

Constructors in bcds.phison.alg with parameters of type SimGraph

ConnectedComponents(SimGraph<V,E> g)
Instantiates a new object.

Uses of SimGraph in bcds.phison.clustering

Fields in bcds.phison.clustering declared as SimGraph

SimGraph<V,E>

GraphCondenser.g A reference to the graph to be condensed.

Methods in bcds.phison.clustering that return SimGraph

SimGraph<V,E>

GraphCondenser.run() Performs the graph condensing and returns the new graph of clusters.

Methods in bcds.phison.clustering with parameters of type SimGraph

void	Clusterer.setup(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost, Environ env) Performs initialization of a new instance.
void	ClustererBase.setup(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost, Environ env) Saves all the parameters received.
void	NoackLinLog.setup(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost, Environ env) Initializes this object.
void	ZoneAsCluster.setup(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost, Environ env) Initializes this instance.

Constructors in bcds.phison.clustering with parameters of type SimGraph

Dummy(SimGraph<V,E> g)
Creates a new instance with edge cost set to 1 and an empty environment.

GraphCondenser(SimGraph<V,E> g, java.util.Map<java.lang.Integer,java.util.List<V>> clusters)
Creates a new instance.

NoackLinLog(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost)
Creates a new instance, assuming a null environment.

ZoneAsCluster(SimGraph<V,E> g, java.util.Map<E,? extends java.lang.Number> edge_cost, ZoneMap<V,E> za)
Creates a new instance.

Uses of SimGraph in bcds.phison.gm

Methods in bcds.phison.gm that return SimGraph

SimGraph<V,E>	GraphMetricBase.getGraph() Returns the reference to the graph, so that classes outside this package can use it.
SimGraph<V,E>	Spreaders.removeNodesOfDegree(SimGraph<V,E> sg, int k) Removes all the nodes with degree k from the graph 'sg' and returns the consequently subgraph.

Methods in bcds.phison.gm with parameters of type SimGraph

boolean	Spreaders.nodesWithDegree(SimGraph<V,E> sg, int k) Returns true if there is a node with degree k .
SimGraph<V,E>	Spreaders.removeNodesOfDegree(SimGraph<V,E> sg, int k) Removes all the nodes with degree k from the graph 'sg' and returns the consequently subgraph.
void	Assortativity.setup(SimGraph<V,E> g, Environ env)
void	AvgTwoTermReliability.setup(SimGraph<V,E> g, Environ env)
void	BrandesBC.setup(SimGraph<V,E> g, Environ env) Reinitializes this instance.
void	CheegerConstantBruteForce.setup(SimGraph<V,E> g, Environ env) Makes sure all links in the topology are bi-directional.
void	ClusteringCoeff.setup(SimGraph<V,E> g, Environ env)
void	Diameter.setup(SimGraph<V,E> g, Environ env) Makes sure all links in the topology are bidirectional.
void	EdgeSetSize.setup(SimGraph<V,E> g, Environ env) Makes sure all links in the topology are bi-directional.
void	GraphMetric.setup(SimGraph<V,E> g, Environ env) (Re)initializes a graph metric instance.
void	GraphMetricBase.setup(SimGraph<V,E> g, Environ env) Saves the parameters for future use.

Constructors in bcds.phison.gm with parameters of type SimGraph

AlgebraicConnectivity(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Assortativity(SimGraph<V,E> g, Environ env)
Creates a new instance.

AverageEdgeBC(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

AverageNeighborConnectivity(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

AverageNodeBC(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

AvgPathLength(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

AvgTwoTermReliability(SimGraph<V,E> g, Environ env)
Creates a new instance.

BrandesBC(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

CheegerConstantBruteForce(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

ClusteringCoeff(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

ConnectivityMatrixSpectralRadius(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Density(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Diameter(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

EdgeSetSize(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Heterogeneity(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

LinkConnectivity(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

MaxNodeDegree(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

NodeConnectivity(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

OutNodeDegree(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

SpectralRadius(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Spreaders(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

SymmetryRatio(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

VertexSetSize(SimGraph<V,E> g, Environ env)
Creates a new instance and calls setup to complete the initialization.

Uses of SimGraph in bcds.phison.io

Constructors in bcds.phison.io with parameters of type SimGraph

DotExporter(java.lang.String fname, SimGraph<V,E> g, java.lang.String prop)
Creates a new instance and saves the parameters for later use.

DotExporter(java.io.Writer wr, SimGraph<V,E> g, java.lang.String prop)
Same as DotExporter.DotExporter(String, SimGraph, String) but the output goes to parameter wr instead.

GraphMLReader(java.lang.String fname, SimGraph<V,E> g)
Creates a new reader.

GraphMLWriter(SimGraph<V,E> g)
Creates a new writer instance for the graph g and sets the output to System.out.

GraphMLWriter(java.lang.String fname, SimGraph<V,E> g)
Creates a new writer instance for the graph g and sets the output to the file fname.

GraphMLWriter(java.io.Writer out, SimGraph<V,E> g)
Creates a new writer instance for the graph g and sets the output to out.

GraphReader(java.lang.String fname, SimGraph<V,E> g)
Creates a GraphReader so that a later call to run() will populate the graph g from the file named fname.

GraphWriter(java.lang.String fname, SimGraph<V,E> g)

GraphWriter(java.io.Writer wr, SimGraph<V,E> g)
Creates a GraphWriter for g and prepares a buffered writer around wr.

NetGraphReader(java.lang.String fname, SimGraph<V,E> g)
Creates a NetGraphReader so that a later call to run() will populate the graph g from the file named fname.

NetGraphWriter(SimGraph<V,E> g)
Creates a new instance that will write the topology g to System.out.

NetGraphWriter(java.lang.String fname, SimGraph<V,E> g)
Creates a new instance that will write the topology g to a file indicated by fname.

NetGraphWriter(java.io.Writer out, SimGraph<V,E> g)
Creates a new instance that will write the topology g to out.

SgfGraphReader(java.lang.String fname, SimGraph<V,E> g)
Creates a SgfGraphReader so that a later call to run() will populate the graph g from the file named fname.

SgfGraphWriter(SimGraph<V,E> g)
Creates a new instance that will write the topology g to System.out.

SgfGraphWriter(java.lang.String fname, SimGraph<V,E> g)
Creates a new instance that will write the topology g to a file indicated by fname.

SgfGraphWriter(java.io.Writer out, SimGraph<V,E> g)
Creates a new instance that will write the topology g to out.

ZoneMap(SimGraph<V,E> g)
Creates a ZoneMap and automatically assign all nodes and links to a default "perfect" zone.

ZoneMap(java.lang.String fname, SimGraph<V,E> g, java.util.Map<java.lang.String,java.lang.String> label_to_id, java.util.Map<java.lang.String,V> id_to_node)
Creates a ZoneMap that will be populated from the contents of the file fname.

Uses of SimGraph in bcds.phison.multfailures

Methods in bcds.phison.multfailures with parameters of type SimGraph

static <V,E> java.util.SortedMap<java.lang.Integer,java.util.List<V>>

SequencerDegree.groupByNodalDegree(SimGraph<V,E> g) Returns a map where nodes are grouped by their "out" nodal degree.

Constructors in bcds.phison.multfailures with parameters of type SimGraph

SID(SimGraph<V,E> g, float beta, float delta_1, float tau, float delta_2)
Creates a new instance that will operate on the given graph and with given rates.

Uses of SimGraph in bcds.phison.ra

Fields in bcds.phison.ra declared as SimGraph

SimGraph<V,E>

TED.g The graph associated to this TED.

Methods in bcds.phison.ra that return SimGraph

SimGraph<V,E>

TED.filterByCap(int min_cap) Returns a subgraph where links with residual capacity less than min_cap are (virtually) removed.

Methods in bcds.phison.ra with parameters of type SimGraph

Path<V,E>

RoutingAlgBase.buildPathFromParentNodes(SimGraph<V,E> g, V dest, java.util.Map<V,V> parent) Builds a Path object from the "parent" structure produced by routing algorithms such as Dijkstra's.

Constructors in bcds.phison.ra with parameters of type SimGraph

TED(SimGraph<V,E> g, java.util.Map<E,java.lang.Integer> link_cap, java.util.Map<E,? extends java.lang.Number> cost)
Creates a new TED instance for the topology g with the link capacities and costs in link_cap and cost respectively.

Uses of SimGraph in bcds.phison.sim

Fields in bcds.phison.sim declared as SimGraph

SimGraph<V,E>

SimGlobals.g The graph to which the rest of the fields refer.