petri编辑工具Pipe2

/* * This software may only be used by you under license from AT&T Corp. * ("AT&T"). A copy of AT&T's Source Code Agreement is available at * AT&T's Internet website having the URL: * <http://www.research.att.com/sw/tools/graphviz/license/source.html> * If you received this software without first entering into a license * with AT&T, you have an infringing copy of this software and cannot use * it without violating AT&T's intellectual property rights. */ package att.grappa; import java.io.*; import java.util.*; /** * This class describes a subgraph, which can consist of * nodes, edges and other subgraphs. Note: The topmost * or root subgraph is the entire graph (the Graph object), which is * an extension of this class. * * @version 1.2, 10 Oct 2006; Copyright 1996 - 2006 by AT&T Corp. * @author <a href="mailto:john@research.att.com">John Mocenigo</a>, <a href="http://www.research.att.com">Research @ AT&T Labs</a> * @see Graph */ public class Subgraph extends Element implements Comparator { /** * Default graph name prefix used by setName(). * * @see Subgraph#setName() */ public final static String defaultNamePrefix = "G"; // node, edge and graph dictionaries for this subgraph private Hashtable nodedict = null; private Hashtable edgedict = null; private Hashtable graphdict = null; // indicators for dislaying element labels when drawing private boolean nodeLabels = true; private boolean edgeLabels = true; private boolean subgLabels = true; // default node attributes private Hashtable nodeAttributes = null; // default edge attributes private Hashtable edgeAttributes = null; // for cluster subgraphs private boolean cluster = false; /** * Reference to the current selection (or vector of selections). * Normally set and used by a GrappaAdapter. */ public Object currentSelection = null; /** * This constructor is needed by the Graph constructor */ Subgraph() { //super(); cluster = true; // the root is a cluster subgraph subgraphAttrsOfInterest(); } /** * Use this constructor when creating a subgraph within a subgraph. * * @param subg the parent subgraph. * @param name the name of this subgraph. */ public Subgraph(Subgraph subg, String name) { super(SUBGRAPH,subg); setName(name); Enumeration enm = subg.getNodeAttributePairs(); while(enm.hasMoreElements()) { setNodeAttribute((Attribute)enm.nextElement()); } enm = subg.getEdgeAttributePairs(); while(enm.hasMoreElements()) { setEdgeAttribute((Attribute)enm.nextElement()); } enm = subg.getLocalAttributePairs(); while(enm.hasMoreElements()) { setAttribute((Attribute)enm.nextElement()); } subgraphAttrsOfInterest(); } /** * Use this constructor when creating a subgraph within a subgraph * with an automatically generated name. * * @param subg the parent subgraph. * @see Subgraph#setName() */ public Subgraph(Subgraph subg) { this(subg,(String)(null)); } // a listing of the attributes of interest for Subgraphs private void subgraphAttrsOfInterest() { //attrOfInterest(BBOX_ATTR); attrOfInterest(MINBOX_ATTR); attrOfInterest(MINSIZE_ATTR); attrOfInterest(LABEL_ATTR); attrOfInterest(LP_ATTR); attrOfInterest(STYLE_ATTR); } /** * Check if this element is a subgraph. * Useful for testing the subclass type of a Element object. * * @return true if this object is a Subgraph. */ public boolean isSubgraph() { return(true); } /** * Get the type of this element. * Useful for distinguishing Element objects. * * @return the class variable constant SUBGRAPH. * @see GrappaConstants#SUBGRAPH */ public int getType() { return(SUBGRAPH); } /** * Generates and sets the name for this subgraph. * The generated name is the concatenation of the * Subgraph.defaultNamePrefix with the numeric * id of this subgraph Instance. * Implements the abstract Element method. * * @see Element#getId() */ void setName() { String oldName = name; while(true) { name = Subgraph.defaultNamePrefix + getId() + "_" + System.currentTimeMillis(); if(getGraph().findSubgraphByName(name) == null) { break; } } // update subgraph graph dictionary if(getSubgraph() != null) { if(oldName != null) { getSubgraph().removeSubgraph(oldName); } getSubgraph().addSubgraph(this); } canonName = null; } /** * Sets the subgraph name to a copy of the supplied argument. * When the argument is null, setName() is called. * When the name is not unique or when the name has the same format as * that generated by setName(), a IllegalArgumentException is thrown. * * @param newName the new name for the subgraph. * @see Subgraph#setName() */ public void setName(String newName) throws IllegalArgumentException { if(newName == null) { setName(); return; } String oldName = name; // test if the new name is the same as the old name (if any) if(oldName != null && oldName.equals(newName)) { return; } // is name unique? if(getGraph().findSubgraphByName(newName) != null) { throw new IllegalArgumentException("graph name (" + newName + ") is not unique"); } name = newName; if(name.startsWith("cluster")) { cluster = true; } // update subgraph graph dictionary if(getSubgraph() != null) { if(oldName != null) { getSubgraph().removeSubgraph(oldName); } getSubgraph().addSubgraph(this); } canonName = null; } /** * Check if the subgraph is a cluster subgraph. * * @return true, if the graph is a cluster subgraph. */ public boolean isCluster() { return cluster; } /** * Check if the subgraph is the root of the graph. * * @return true, if the graph is the root of the graph. */ public boolean isRoot() { return (this == (Subgraph)getGraph()); } /** * Gets the subgraph-specific default attribute for the named node attribute. * * @param key the name of the node attribute pair to be retrieved. * @return the requested attribute pair or null if not found. */ public Attribute getNodeAttribute(String key) { if(nodeAttributes == null) return(null); return((Attribute)(nodeAttributes.get(key))); } /** * Gets the subgraph-specific default value for the named node attribute. * * @param key the name of the node attribute pair to be retrieved. * @return the requested attribute value or null if not found. */ public Object getNodeAttributeValue(String key) { Attribute attr; if(nodeAttributes == null) return(null); if((attr = (Attribute)(nodeAttributes.get(key))) == null) return(null); return(attr.getValue()); } /** * Gets an enumeration of the subgraph-specific node attribute keys * * @return an enumeration of String objects. */ public Enumeration getNodeAttributeKeys() { if(nodeAttributes == null) return Grappa.emptyEnumeration.elements(); return(nodeAttributes.keys()); } /** * Gets an enumeration of the subgraph-specific node attributes * * @return an enumeration of Attribute objects. */ public Enumeration getNodeAttributePairs() { if(nodeAttributes == null) return Grappa.emptyEnumeration.elements(); return(nodeAttributes.elements()); } /** * Sets the subgraph-specific default for the specified node attribute. * If the attribute is not from the pare