GraphUtils.SynchronizedGraphWrapper

Overview

Package

Class

Use

Deprecated

Index

Home >> All >> com >> phoenixst >> [ plexus overview ]

PREV CLASS NEXT CLASS

SUMMARY:

JAVADOC |

Sourc code of com.phoenixst.plexus.GraphUtils

SOURCE |

Download com.phoenixst.plexus.GraphUtils

DOWNLOAD | NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

com.phoenixst.plexus
Class GraphUtils.SynchronizedGraphWrapper

java.lang.Object
  com.phoenixst.plexus.GraphWrapper
      com.phoenixst.plexus.GraphUtils.SynchronizedGraphWrapper

All Implemented Interfaces:: Graph, java.io.Serializable

Direct Known Subclasses:: GraphUtils.SynchronizedObservableGraphWrapper

Enclosing class:: GraphUtils

private static class GraphUtils.SynchronizedGraphWrapper
extends GraphWrapper

Nested Class Summary

private class GraphUtils.SynchronizedGraphWrapper.SynchronizedEdgeWrapper


private class GraphUtils.SynchronizedGraphWrapper.SynchronizedIteratorWrapper


private class GraphUtils.SynchronizedGraphWrapper.SynchronizedTraverserWrapper


Nested classes inherited from class com.phoenixst.plexus.GraphWrapper

GraphWrapper.EdgeIteratorWrapper, GraphWrapper.EdgeWrapper, GraphWrapper.NodeIteratorWrapper, GraphWrapper.TraverserWrapper

Nested classes inherited from class com.phoenixst.plexus.Graph

Graph.Edge

Field Summary

protected java.lang.Object mutex


Fields inherited from class com.phoenixst.plexus.GraphWrapper

g

Constructor Summary

private GraphUtils.SynchronizedGraphWrapper(Graph g)


private GraphUtils.SynchronizedGraphWrapper(Graph g, java.lang.Object mutex)


Method Summary

Graph.Edge addEdge(java.lang.Object object, java.lang.Object tail, java.lang.Object head)
          Adds the specified edge to the Graph (optional operation).

boolean addNode(java.lang.Object node)
          Adds node to this Graph (optional operation).

void clear()
          Removes all nodes and edges from this Graph (optional operation).

boolean containsEdge(Graph.Edge edge)
          Returns true if this Graph contains the specified Edge.

boolean containsNode(java.lang.Object node)
          Returns true if this Graph contains the specified node.

int degree(java.lang.Object node)
          Returns the degree of node, defined as the number of edges incident on node, with self-loops counted twice.

java.util.Iterator edgeIterator()
          Returns an Iterator over all the Edges in this Graph.

java.util.Iterator edgeIterator(java.lang.Object tail, java.lang.Object head)
          Returns an Iterator over all Edges from this Graph with the specified tail and head.

int edgeSize()
          Returns the number of edges in this Graph.

Graph.Edge getEdge(java.lang.Object tail, java.lang.Object head)
          Returns an Edge from this Graph with the specified tail and head, or null if it does not exist.

int inDegree(java.lang.Object node)
          If this is a directed graph, returns the in degree of node, defined as the number of edges entering node.

Traverser inTraverser(java.lang.Object node)
          If this is a directed graph, returns a Traverser from node to all adjacent nodes reachable through edges whose head is the given node.

boolean isDirected()
          Returns whether or not this Graph is directed.

boolean isEmpty()
          Returns true if this Graph contains no edges, it may contain nodes.

boolean isSimple()
          Returns whether or not this Graph is simple.

java.util.Iterator nodeIterator()
          Returns an Iterator over all the nodes in this Graph.

int nodeSize()
          Returns the number of nodes in this Graph.

int outDegree(java.lang.Object node)
          If this is a directed graph, returns the out degree of node, defined as the number of edges leaving node.

Traverser outTraverser(java.lang.Object node)
          If this is a directed graph, returns a Traverser from node to all adjacent nodes reachable through edges whose tail is the given node.

boolean removeEdge(Graph.Edge edge)
          Removes the specified Edge from this Graph (optional operation).

boolean removeNode(java.lang.Object node)
          Removes node from this Graph (optional operation).

Traverser traverser(java.lang.Object node)
          Returns a Traverser from node to all adjacent nodes.

protected GraphWrapper.EdgeWrapper wrapEdge(Graph.Edge edge)
          Returns a wrapped Edge.

protected java.util.Iterator wrapEdgeIterator(java.util.Iterator edgeIter)
          Returns a wrapped edge iterator.

protected java.util.Iterator wrapNodeIterator(java.util.Iterator nodeIter)
          Returns a wrapped node iterator.

protected Traverser wrapTraverser(Traverser traverser)
          Returns a wrapped traverser.

Methods inherited from class com.phoenixst.plexus.GraphWrapper

unwrapEdge, unwrapEdgeObject, unwrapNode, wrapEdgeObject, wrapNode

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

mutex

protected java.lang.Object mutex

Constructor Detail

GraphUtils.SynchronizedGraphWrapper

private GraphUtils.SynchronizedGraphWrapper(Graph g)

GraphUtils.SynchronizedGraphWrapper

private GraphUtils.SynchronizedGraphWrapper(Graph g,
                                            java.lang.Object mutex)

Method Detail

wrapEdge

protected GraphWrapper.EdgeWrapper wrapEdge(Graph.Edge edge)

Description copied from class: GraphWrapper

Returns a wrapped Edge.

Overrides:: wrapEdge in class GraphWrapper

wrapNodeIterator

protected java.util.Iterator wrapNodeIterator(java.util.Iterator nodeIter)

Description copied from class: GraphWrapper

Returns a wrapped node iterator.

Overrides:: wrapNodeIterator in class GraphWrapper

wrapEdgeIterator

protected java.util.Iterator wrapEdgeIterator(java.util.Iterator edgeIter)

Description copied from class: GraphWrapper

Returns a wrapped edge iterator.

Overrides:: wrapEdgeIterator in class GraphWrapper

wrapTraverser

protected Traverser wrapTraverser(Traverser traverser)

Description copied from class: GraphWrapper

Returns a wrapped traverser.

Overrides:: wrapTraverser in class GraphWrapper