Class BigraphAnalysis
java.lang.Object
org.bigraphs.framework.core.analysis.BigraphAnalysis
Deprecated.
This helper class (facade) contains a collection of methods to quickly bootstrap graph-theoretical analysis for bigraphs.
- Connectedness: A simple graph is connected if it has no separation, i.e., there is a path between every pair of nodes, and removing any edge will disconnect the graph.
- Author:
- Dominik Grzelak
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionboolean
linkGraphIsConnectedGraph
(PureBigraph linkGraph) Deprecated.This method computes whether the link graph of a bigraph is connected.boolean
placeGraphIsConnectedGraph
(PureBigraph placeGraph) Deprecated.This method determines whether the place graph of a bigraph is connected.
-
Constructor Details
-
BigraphAnalysis
public BigraphAnalysis()Deprecated.
-
-
Method Details
-
placeGraphIsConnectedGraph
Deprecated.This method determines whether the place graph of a bigraph is connected. This is easy, since the PG is a forest. A forest is a graph whose connected components are trees, and a tree is a connected graph without cycles.This method exists for reasons of code symmetry (refer to
linkGraphIsConnectedGraph(PureBigraph)
).- Parameters:
placeGraph
- the bigraph, can also benull
.- Returns:
true
always
-
linkGraphIsConnectedGraph
Deprecated.This method computes whether the link graph of a bigraph is connected. It uses the Union-Find Algorithm with almost linear running time.- Parameters:
linkGraph
- the bigraph- Returns:
true
if the link graph is connected, otherwisefalse
-