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.ArrayList;
32 import java.util.Collections;
33 import java.util.List;
58 protected final void apply(
final boolean p_parallel, @Nonnull
final Graph<Object, Object> p_graph,
59 @Nonnull
final List<ITerm> p_window, @Nonnull
final List<ITerm> p_return )
61 final List<?> l_return =
new ArrayList<>( p_graph.findEdgeSet( p_window.get( 0 ).raw(), p_window.get( 1 ) .raw() ) );
66 ? Collections.synchronizedList( l_return )
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
returns all edges of all vertex tuples for a single graph instance.
static< N > CRawTerm< N > from(final N p_value)
factory for a raw term
apply class for a single graph with multiple elements
term structure for simple datatypes