Class BigraphMatchingSupport
java.lang.Object
org.bigraphs.framework.simulation.matching.BigraphMatchingSupport
- Direct Known Subclasses:
PureBigraphMatchingEngine
- Author:
- Dominik Grzelak
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionstatic org.jgrapht.Graph<BigraphEntity<?>,
org.jgrapht.graph.DefaultEdge> Helper function to create a directed graph.static org.jgrapht.Graph<BigraphEntity<?>,
org.jgrapht.graph.DefaultEdge> createBipartiteGraph
(List<BigraphEntity<?>> x, List<BigraphEntity<?>> y) Helper function to create a bipartite graph.List<BigraphEntity<?>>
getSubBigraphFrom
(BigraphEntity<?> node, AbstractDynamicMatchAdapter adapter) boolean
isSameControl
(BigraphEntity<?> node1, BigraphEntity<?> node2) Helper method to check whether two nodes have the same control
-
Field Details
-
executorService
-
-
Constructor Details
-
BigraphMatchingSupport
public BigraphMatchingSupport()
-
-
Method Details
-
getSubBigraphFrom
public List<BigraphEntity<?>> getSubBigraphFrom(BigraphEntity<?> node, AbstractDynamicMatchAdapter adapter) -
isSameControl
Helper method to check whether two nodes have the same control- Parameters:
node1
- first nodenode2
- second node- Returns:
true
if both nodes have the same control, otherwisefalse
-
createBipartiteGraph
public static org.jgrapht.Graph<BigraphEntity<?>,org.jgrapht.graph.DefaultEdge> createBipartiteGraph(List<BigraphEntity<?>> x, List<BigraphEntity<?>> y) Helper function to create a bipartite graph.- Parameters:
x
- first set of nodesy
- second set of nodes- Returns:
- a bipartite graph
-
buildEmptySimpleDirectedGraph
public static org.jgrapht.Graph<BigraphEntity<?>,org.jgrapht.graph.DefaultEdge> buildEmptySimpleDirectedGraph()Helper function to create a directed graph.- Returns:
- a directed graph
-