RandomMGraph

interconnectivity - Determines the probability of using already existing
resource when creating a new triple. The probability of using an existing
resource over creating a new resouce is 1-(1/interconnectivity).

addGraphListener

Adds the specified GraphListener to the graph. This listener
will be notified, when the graph is modified and the Triple
that was part of the modifiaction matched the specified
FilterTriple. The notification will be passed to the
listener after the specified delay time (in milli-seconds) has passed.
If more matching events occur during the delay period, then they are
passed all together at the end of the delay period. If the the listener
unregisters or the platform is stopped within the period then the already
occurred events may not be delivered.
All implementations support this method, immutable implementations will
typically provide an empty implementation, they shall not throw an
exception.
Implementation of which the triples change over time without add- and
remove-methods being called (e.g. implementation dynamically generating
their triples on invocation of the filer-method) may choose not to, or
only partially propagate their changes to the listener. They should
describe the behavior in the documentation of the class.
Implementations should keep weak references the listeners, so that the
listener can be garbage collected if its no longer referenced by another
object.
If delay is 0 notification will happen synchroneously.

addGraphListener

Adds the specified GraphListener to the graph. This listener
will be notified, when the graph is modified and the Triple
that was part of the modifiaction matched the specified
FilterTriple. The notification will be passed without delay.
Same as addGraphListener(listener, filter, 0).