Java Doc for Graph.java in  » Database-DBMS » db4o-6.4 » EDU » purdue » cs » bloat » util » 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 » Database DBMS » db4o 6.4 » EDU.purdue.cs.bloat.util   Source Cross Reference   Class Diagram   Java Document (Java Doc)   java.lang.Object    EDU.purdue.cs.bloat.util.Graph All known Subclasses:   EDU.purdue.cs.bloat.cfg.FlowGraph, Graph public class Graph (Code) Graph represents a graph of nodes with directed edges between them. GraphNodes are created and are added to the Graph before the edges can be constructed. Each GraphNode as a unique key associated with it. For instance, if a Graph represents a control flow graph, each GraphNode would be associated with a basic block. See Also:   Graph.addNode See Also:   Graph.addEdge See Also:   GraphNode See Also:   EDU.purdue.cs.bloat.cfg.FlowGraph Inner Class :class NodeMap extends AbstractMap Inner Class :class NodeList extends ArrayList implements List Inner Class :class EdgeSet extends AbstractSet Field Summary protected  int edgeModCount      protected  int nodeModCount      protected  int removingEdge      protected  int removingNode      protected  int revRootEdgeModCount      protected  int rootEdgeModCount      Constructor Summary public   Graph()      Constructor. Method Summary public  void addEdge(GraphNode v, GraphNode w)      Adds a directed edge from node v to node w. public  void addNode(Object key, GraphNode node)      Insertes a node (and its associated key) into this Graph. Parameters:   key - A unique value associated with this node. public  GraphNode getNode(Object key)      Returns the node in this Graph with a given key. public  boolean hasEdge(GraphNode v, GraphNode w)      Searches this Graph for an (directed) edge between two GraphNodes. Parameters:   v - Source node of desired edge. Parameters:   w - Destination node of desired edge. public  boolean hasNode(GraphNode v)      Searchs this Graph for a given GraphNode. Parameters:   v - GraphNode to search for. public  boolean isAncestorToDescendent(GraphNode v, GraphNode w)      Determines whether or not a node v is an ancestor (has a lower pre-order index and a higher post-order index) of a node w. Parameters:   v - Candidate ancestor node. Parameters:   w - Candidate descendent node. public  Set keySet()      Returns a Set of the keys used to uniquely identify the nodes in this Graph. public  Collection nodes()      Returns all the nodes in this Graph. public  List postOrder()      Return the nodes in this Graph ordered by their post-order index. public  int postOrderIndex(GraphNode node)      Returns the index of a given node in a post-order ordering of this Graph. public  List preOrder()      Returns the nodes in this Graph ordered by their pre-order index. public  int preOrderIndex(GraphNode node)      Returns the index of a given node in a pre-order ordering of this Graph. public  Collection preds(GraphNode v)      Returns the predacessors of a given node. public  void removeEdge(GraphNode v, GraphNode w)      public  void removeNode(Object key)      Removes a node with a given key from the Graph. public  void removeUnreachable()      Removes all nodes from this Graph that cannot be reached in a pre-order traversal of the Graph. public  Collection reverseRoots()      The reverse roots of this Graph. public  Collection roots()      The roots of this Graph. public  int size()      Returns the number of nodes in this Graph. public  Collection succs(GraphNode v)      Return the successors of a given node. public  String toString()      Field Detail edgeModCount protected int edgeModCount(Code) nodeModCount protected int nodeModCount(Code) removingEdge protected int removingEdge(Code) removingNode protected int removingNode(Code) revRootEdgeModCount protected int revRootEdgeModCount(Code) rootEdgeModCount protected int rootEdgeModCount(Code) Constructor Detail Graph public Graph()(Code) Constructor. Method Detail addEdge public void addEdge(GraphNode v, GraphNode w)(Code) Adds a directed edge from node v to node w. Parameters:   v - Source node. Parameters:   w - Destination node. addNode public void addNode(Object key, GraphNode node)(Code) Insertes a node (and its associated key) into this Graph. Parameters:   key - A unique value associated with this node. For instance, ifthis Graph represented a control flow graph, the key would bea basic block. Parameters:   node - The node to be added. getNode public GraphNode getNode(Object key)(Code) Returns the node in this Graph with a given key. hasEdge public boolean hasEdge(GraphNode v, GraphNode w)(Code) Searches this Graph for an (directed) edge between two GraphNodes. Parameters:   v - Source node of desired edge. Parameters:   w - Destination node of desired edge. True, if an edge exists between nodes v and w. hasNode public boolean hasNode(GraphNode v)(Code) Searchs this Graph for a given GraphNode. Parameters:   v - GraphNode to search for. True, if this Graphs contains v. isAncestorToDescendent public boolean isAncestorToDescendent(GraphNode v, GraphNode w)(Code) Determines whether or not a node v is an ancestor (has a lower pre-order index and a higher post-order index) of a node w. Parameters:   v - Candidate ancestor node. Parameters:   w - Candidate descendent node. True, if v is an ancestor of w. keySet public Set keySet()(Code) Returns a Set of the keys used to uniquely identify the nodes in this Graph. nodes public Collection nodes()(Code) Returns all the nodes in this Graph. postOrder public List postOrder()(Code) Return the nodes in this Graph ordered by their post-order index. postOrderIndex public int postOrderIndex(GraphNode node)(Code) Returns the index of a given node in a post-order ordering of this Graph. preOrder public List preOrder()(Code) Returns the nodes in this Graph ordered by their pre-order index. preOrderIndex public int preOrderIndex(GraphNode node)(Code) Returns the index of a given node in a pre-order ordering of this Graph. preds public Collection preds(GraphNode v)(Code) Returns the predacessors of a given node. removeEdge public void removeEdge(GraphNode v, GraphNode w)(Code) removeNode public void removeNode(Object key)(Code) Removes a node with a given key from the Graph. Parameters:   key - The key associated with the node to remove. removeUnreachable public void removeUnreachable()(Code) Removes all nodes from this Graph that cannot be reached in a pre-order traversal of the Graph. These nodes have a pre-order index of -1. reverseRoots public Collection reverseRoots()(Code) The reverse roots of this Graph. That is, the nodes with nosuccessors. roots public Collection roots()(Code) The roots of this Graph. That is, the nodes with no predacessors. size public int size()(Code) Returns the number of nodes in this Graph. succs public Collection succs(GraphNode v)(Code) Return the successors of a given node. toString public String toString()(Code) 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)