24 package org.lightjason.agentspeak.action.builtin.graph;
26 import edu.uci.ics.jung.graph.Graph;
30 import javax.annotation.Nonnull;
31 import java.util.List;
56 protected final void apply(
final boolean p_parallel, @Nonnull
final Graph<Object, Object> p_graph,
57 @Nonnull
final List<ITerm> p_window, @Nonnull
final List<ITerm> p_return )
61 (
double) p_graph.getNeighborCount( p_window.get( 0 ).raw() )
apply an element on multiple graphs
final void apply(final boolean p_parallel, @Nonnull final Graph< Object, Object > p_graph, @Nonnull final List< ITerm > p_window, @Nonnull final List< ITerm > p_return)
static final long serialVersionUID
serial id
static< N > CRawTerm< N > from(final N p_value)
factory for a raw term
returns the number neighbors of a vertex of each graph instance.
term structure for simple datatypes