LightJason - AgentSpeak(L++)
CAddEdgeMultiple.java
Go to the documentation of this file.
1 /*
2  * @cond LICENSE
3  * ######################################################################################
4  * # LGPL License #
5  * # #
6  * # This file is part of the LightJason AgentSpeak(L++) #
7  * # Copyright (c) 2015-19, LightJason (info@lightjason.org) #
8  * # This program is free software: you can redistribute it and/or modify #
9  * # it under the terms of the GNU Lesser General Public License as #
10  * # published by the Free Software Foundation, either version 3 of the #
11  * # License, or (at your option) any later version. #
12  * # #
13  * # This program is distributed in the hope that it will be useful, #
14  * # but WITHOUT ANY WARRANTY; without even the implied warranty of #
15  * # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #
16  * # GNU Lesser General Public License for more details. #
17  * # #
18  * # You should have received a copy of the GNU Lesser General Public License #
19  * # along with this program. If not, see http://www.gnu.org/licenses/ #
20  * ######################################################################################
21  * @endcond
22  */
23 
24 package org.lightjason.agentspeak.action.builtin.graph;
25 
26 import edu.uci.ics.jung.graph.Graph;
28 
29 import javax.annotation.Nonnull;
30 import java.util.List;
31 
32 
43 public final class CAddEdgeMultiple extends IApplyMultiple
44 {
48  private static final long serialVersionUID = -4562621710701411252L;
49 
50  @Override
51  protected final int windowsize()
52  {
53  return 3;
54  }
55 
56  @Override
57  protected final void apply( final boolean p_parallel, @Nonnull final Graph<Object, Object> p_graph,
58  @Nonnull final List<ITerm> p_window, @Nonnull final List<ITerm> p_return )
59  {
60  p_graph.addEdge( p_window.get( 0 ).raw(), p_window.get( 1 ).raw(), p_window.get( 2 ).raw(), p_graph.getDefaultEdgeType() );
61  }
62 
63 }
add multiple edges to a single graph instance.
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)
apply class for a single graph with multiple elements