Java Doc for DigraphNode.java in  » 6.0-JDK-Core » image » javax » imageio » spi » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Home 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 26. ERP CRM Financial 27. ESB 28. Forum 29. Game 30. GIS 31. Graphic 3D 32. Graphic Library 33. Groupware 34. HTML Parser 35. IDE 36. IDE Eclipse 37. IDE Netbeans 38. Installer 39. Internationalization Localization 40. Inversion of Control 41. Issue Tracking 42. J2EE 43. J2ME 44. JBoss 45. JMS 46. JMX 47. Library 48. Mail Clients 49. Music 50. Net 51. Parser 52. PDF 53. Portal 54. Profiler 55. Project Management 56. Report 57. RSS RDF 58. Rule Engine 59. Science 60. Scripting 61. Search Engine 62. Security 63. Sevlet Container 64. Source Control 65. Swing Library 66. Template Engine 67. Test Coverage 68. Testing 69. UML 70. Web Crawler 71. Web Framework 72. Web Mail 73. Web Server 74. Web Services 75. Web Services apache cxf 2.2.6 76. Web Services AXIS2 77. Wiki Engine 78. Workflow Engines 79. XML 80. XML UI

Java Source Code / Java Documentation » 6.0 JDK Core » image » javax.imageio.spi   Source Cross Reference   Class Diagram   Java Document (Java Doc)   java.lang.Object    javax.imageio.spi.DigraphNode DigraphNode class DigraphNode implements Cloneable,Serializable(Code) A node in a directed graph. In addition to an arbitrary Object containing user data associated with the node, each node maintains a Sets of nodes which are pointed to by the current node (available from getOutNodes). The in-degree of the node (that is, number of nodes that point to the current node) may be queried. version:    0.5 Field Summary protected  Object data      The data associated with this node. protected  int inDegree      The in-degree of the node. protected  Set outNodes      A Set of neighboring nodes pointed to by this node. Constructor Summary public   DigraphNode(Object data)      Method Summary public  boolean addEdge(DigraphNode node)      Adds a directed edge to the graph. public  void dispose()      Removes this node from the graph, updating neighboring nodes appropriately. public  Object getData()      Returns the Object referenced by this node. public  int getInDegree()      Returns the in-degree of this node. public  Iterator getOutNodes()      Returns an Iterator containing the nodes pointed to by this node. public  boolean hasEdge(DigraphNode node)      Returns true if an edge exists between this node and the given node. Parameters:   node - a DigraphNode. public  boolean removeEdge(DigraphNode node)      Removes a directed edge from the graph. Field Detail data protected Object data(Code) The data associated with this node. inDegree protected int inDegree(Code) The in-degree of the node. outNodes protected Set outNodes(Code) A Set of neighboring nodes pointed to by this node. Constructor Detail DigraphNode public DigraphNode(Object data)(Code) Method Detail addEdge public boolean addEdge(DigraphNode node)(Code) Adds a directed edge to the graph. The outNodes list of this node is updated and the in-degree of the other node is incremented. Parameters:   node - a DigraphNode. true if the node was not previously thetarget of an edge. dispose public void dispose()(Code) Removes this node from the graph, updating neighboring nodes appropriately. getData public Object getData()(Code) Returns the Object referenced by this node. getInDegree public int getInDegree()(Code) Returns the in-degree of this node. getOutNodes public Iterator getOutNodes()(Code) Returns an Iterator containing the nodes pointed to by this node. hasEdge public boolean hasEdge(DigraphNode node)(Code) Returns true if an edge exists between this node and the given node. Parameters:   node - a DigraphNode. true if the node is the target of an edge. removeEdge public boolean removeEdge(DigraphNode node)(Code) Removes a directed edge from the graph. The outNodes list of this node is updated and the in-degree of the other node is decremented. true if the node was previously the targetof an edge. 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)