/*
Violet - A program for editing UML diagrams.
Copyright (C) 2007 Cay S. Horstmann (http://horstmann.com)
Alexandre de Pellegrin (http://alexdp.free.fr);
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package com.horstmann.violet.product.diagram.state;
import java.util.*;
import com.horstmann.violet.product.diagram.abstracts.AbstractGraph;
import com.horstmann.violet.product.diagram.abstracts.edge.IEdge;
import com.horstmann.violet.product.diagram.abstracts.node.INode;
import com.horstmann.violet.product.diagram.common.edge.NoteEdge;
import com.horstmann.violet.product.diagram.common.node.NoteNode;
import com.horstmann.violet.product.diagram.state.edge.StateTransitionEdge;
import com.horstmann.violet.product.diagram.state.node.*;
/**
* An UML state diagram.
*/
public class StateDiagramGraph extends AbstractGraph
{
public List<INode> getNodePrototypes()
{
return NODE_PROTOTYPES;
}
public List<IEdge> getEdgePrototypes()
{
return EDGE_PROTOTYPES;
}
private static final List<INode> NODE_PROTOTYPES = new ArrayList<INode>(Arrays.asList(
new CircularInitialStateNode(),
new StateNode(),
new CircularFinalStateNode(),
new DecisionNode(),
new ExternalSystemEntryPointNode(),
new ExternalSystemExitPointNode(),
new NoteNode()
));
private static final List<IEdge> EDGE_PROTOTYPES = new ArrayList<IEdge>(Arrays.asList(
new StateTransitionEdge(),
new NoteEdge()
));
}