Package org.bigraphs.framework.simulation.matching.pure

Class IHSFilter

java.lang.Object

org.bigraphs.framework.simulation.matching.pure.IHSFilter

public class IHSFilter
extends Object

Author:

Dominik Grzelak

Constructor Summary

Constructors

Constructor	Description
IHSFilter(Bigraph<?> redexAdapter, Bigraph<?> agentAdapter)

Method Summary

Modifier and Type	Method	Description
Set<BigraphEntity.NodeEntity<?>>	adj(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
boolean	condition1(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Degree and label
boolean	condition2(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	The number of adjacent nodes
boolean	condition3(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Arity containment of hyperedges
boolean	condition4(BigraphEntity.NodeEntity<?> nodeRedex, BigraphEntity.NodeEntity<?> nodeAgent)	Label matchings of hyperedges
int	degree(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
Map<Integer,List<BigraphEntity.Link>>	getIncidentHyperedges(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)
String	getLabel(BigraphEntity.NodeEntity<?> node)
Set<BigraphEntity.NodeEntity<?>>	getOfNodesForHyperedgeWithLabel(BigraphEntity.Link he, String label, Bigraph<?> bigraph)
int	numOfadj(BigraphEntity.NodeEntity<?> node, Bigraph<?> bigraph)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

IHSFilter

public IHSFilter(Bigraph<?> redexAdapter,
 Bigraph<?> agentAdapter)

Method Details

condition1

public boolean condition1(BigraphEntity.NodeEntity<?> nodeRedex,
 BigraphEntity.NodeEntity<?> nodeAgent)

Degree and label

condition2

public boolean condition2(BigraphEntity.NodeEntity<?> nodeRedex,
 BigraphEntity.NodeEntity<?> nodeAgent)

The number of adjacent nodes

condition3

public boolean condition3(BigraphEntity.NodeEntity<?> nodeRedex,
 BigraphEntity.NodeEntity<?> nodeAgent)

Arity containment of hyperedges

condition4

public boolean condition4(BigraphEntity.NodeEntity<?> nodeRedex,
 BigraphEntity.NodeEntity<?> nodeAgent)

Label matchings of hyperedges

getOfNodesForHyperedgeWithLabel

public Set<BigraphEntity.NodeEntity<?>> getOfNodesForHyperedgeWithLabel(BigraphEntity.Link he,
 String label,
 Bigraph<?> bigraph)

getIncidentHyperedges

public Map<Integer,List<BigraphEntity.Link>> getIncidentHyperedges(BigraphEntity.NodeEntity<?> node,
 Bigraph<?> bigraph)

degree

public int degree(BigraphEntity.NodeEntity<?> node,
 Bigraph<?> bigraph)

Returns:

the number of incident hyperedges

getLabel

public String getLabel(BigraphEntity.NodeEntity<?> node)

numOfadj

public int numOfadj(BigraphEntity.NodeEntity<?> node,
 Bigraph<?> bigraph)

Returns:

The number of adjacent nodes

adj

public Set<BigraphEntity.NodeEntity<?>> adj(BigraphEntity.NodeEntity<?> node,
 Bigraph<?> bigraph)