Java Doc for MapGraph.java in  » Workflow-Engines » pegasus-2.1.0 » org » griphyn » cPlanner » partitioner » graph » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation 1.  6.0 JDK Core 2.  6.0 JDK Modules 3.  6.0 JDK Modules com.sun 4.  6.0 JDK Modules com.sun.java 5.  6.0 JDK Modules sun 6.  6.0 JDK Platform 7.  Ajax 8.  Apache Harmony Java SE 9.  Aspect oriented 10.  Authentication Authorization 11.  Blogger System 12.  Build 13.  Byte Code 14.  Cache 15.  Chart 16.  Chat 17.  Code Analyzer 18.  Collaboration 19.  Content Management System 20.  Database Client 21.  Database DBMS 22.  Database JDBC Connection Pool 23.  Database ORM 24.  Development 25.  EJB Server geronimo 26.  EJB Server GlassFish 27.  EJB Server JBoss 4.2.1 28.  EJB Server resin 3.1.5 29.  ERP CRM Financial 30.  ESB 31.  Forum 32.  GIS 33.  Graphic Library 34.  Groupware 35.  HTML Parser 36.  IDE 37.  IDE Eclipse 38.  IDE Netbeans 39.  Installer 40.  Internationalization Localization 41.  Inversion of Control 42.  Issue Tracking 43.  J2EE 44.  JBoss 45.  JMS 46.  JMX 47.  Library 48.  Mail Clients 49.  Net 50.  Parser 51.  PDF 52.  Portal 53.  Profiler 54.  Project Management 55.  Report 56.  RSS RDF 57.  Rule Engine 58.  Science 59.  Scripting 60.  Search Engine 61.  Security 62.  Sevlet Container 63.  Source Control 64.  Swing Library 65.  Template Engine 66.  Test Coverage 67.  Testing 68.  UML 69.  Web Crawler 70.  Web Framework 71.  Web Mail 72.  Web Server 73.  Web Services 74.  Web Services apache cxf 2.0.1 75.  Web Services AXIS2 76.  Wiki Engine 77.  Workflow Engines 78.  XML 79.  XML UI Java Java Tutorial Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

Java Source Code / Java Documentation » Workflow Engines » pegasus 2.1.0 » org.griphyn.cPlanner.partitioner.graph   Source Cross Reference   Class Diagram   Java Document (Java Doc)   java.lang.Object    org.griphyn.cPlanner.partitioner.graph.MapGraph MapGraph public class MapGraph implements Graph(Code) An implementation of the Graph that is backed by a Map. author:    Karan Vahi vahi@isi.edu version:    $Revision: 50 $ Inner Class :protected class MapGraphIterator implements Iterator Field Summary protected  Map mStore      The map indexed by the id of the GraphNode, used for storing the nodes of the Graph. Constructor Summary public   MapGraph()      The default constructor. Method Summary public  void addEdge(String parent, String child)      Adds an edge between two already existing nodes in the graph. public  void addEdges(String child, List parents)      A convenience method that allows for bulk addition of edges between already existing nodes in the graph. public  void addNode(GraphNode node)      Adds a node to the Graph. public  void addRoot(GraphNode root)      Adds a single root node to the Graph. public  Object clone()      Returns a copy of the object. public  Object get(Object key)      It returns the value associated with the key in the map. public  List getLeaves()      Returns the leaf nodes of the Graph. public  GraphNode getNode(String identifier)      Returns the node matching the id passed. Parameters:   identifier - the id of the node. public  List getRoots()      Returns the root nodes of the Graph. public  Iterator iterator()      Returns an iterator that traverses through the graph using a graph traversal algorithm. public  Iterator nodeIterator()      Returns an iterator for the nodes in the Graph. public  boolean remove(String identifier)      Removes a node from the Graph. Parameters:   identifier - the id of the node to be removed. public  String toString()      The textual representation of the graph node. Field Detail mStore protected Map mStore(Code) The map indexed by the id of the GraphNode, used for storing the nodes of the Graph. The value for each key is the corresponding GraphNode of the class. Constructor Detail MapGraph public MapGraph()(Code) The default constructor. Method Detail addEdge public void addEdge(String parent, String child)(Code) Adds an edge between two already existing nodes in the graph. Parameters:   parent - the parent node ID. Parameters:   child - the child node ID. addEdges public void addEdges(String child, List parents)(Code) A convenience method that allows for bulk addition of edges between already existing nodes in the graph. Parameters:   child - the child node ID Parameters:   parents - list of parent identifiers as String. addNode public void addNode(GraphNode node)(Code) Adds a node to the Graph. It overwrites an already existing node with the same ID. Parameters:   node - the node to be added to the Graph. addRoot public void addRoot(GraphNode root)(Code) Adds a single root node to the Graph. All the exisitng roots of the Graph become children of the root. Parameters:   root - the GraphNode to be added as a root. throws:   RuntimeException - if a node with the same id already exists. clone public Object clone()(Code) Returns a copy of the object. clone of the object. get public Object get(Object key)(Code) It returns the value associated with the key in the map. Parameters:   key - the key to the entry in the map. getLeaves public List getLeaves()(Code) Returns the leaf nodes of the Graph. a list containing GraphNode corressponding to theleaf nodes. getNode public GraphNode getNode(String identifier)(Code) Returns the node matching the id passed. Parameters:   identifier - the id of the node. the node matching the ID else null. getRoots public List getRoots()(Code) Returns the root nodes of the Graph. a list containing GraphNode corressponding to theroot nodes. iterator public Iterator iterator()(Code) Returns an iterator that traverses through the graph using a graph traversal algorithm. At any one time, only one iterator can iterate through the graph. Iterator through the nodes of the graph. nodeIterator public Iterator nodeIterator()(Code) Returns an iterator for the nodes in the Graph. Iterator remove public boolean remove(String identifier)(Code) Removes a node from the Graph. Parameters:   identifier - the id of the node to be removed. boolean indicating whether the node was removed or not. toString public String toString()(Code) The textual representation of the graph node. textual description. Methods inherited from java.lang.Object native protected Object clone() throws CloneNotSupportedException(Code)(Java Doc) public boolean equals(Object obj)(Code)(Java Doc) protected void finalize() throws Throwable(Code)(Java Doc) final native public Class getClass()(Code)(Java Doc) native public int hashCode()(Code)(Java Doc) final native public void notify()(Code)(Java Doc) final native public void notifyAll()(Code)(Java Doc) public String toString()(Code)(Java Doc) final native public void wait(long timeout) throws InterruptedException(Code)(Java Doc) final public void wait(long timeout, int nanos) throws InterruptedException(Code)(Java Doc) final public void wait() throws InterruptedException(Code)(Java Doc)