Lyophilizer: Uses of Class net.walend.digraph.NodeMissingException

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV NEXT

FRAMES NO FRAMES All Classes

Uses of Class
net.walend.digraph.NodeMissingException

Packages that use NodeMissingException
net.walend.digraph	This package contains a kit for working with directed graphs.

Uses of NodeMissingException in net.walend.digraph

Methods in net.walend.digraph that throw NodeMissingException

boolean GEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns true if the digraph contains any edge from fromNode to toNode

int GEDigraph.countInboundEdges(java.lang.Object node)


int GEDigraph.countOutboundEdges(java.lang.Object node)


Set GEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set GEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.

java.lang.Object MutableHashUEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)


Set MutableHashUEDigraph.removeNode(java.lang.Object node)


java.lang.Object MutableHashUEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)


java.lang.Object MutableHashCEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)


Set MutableHashCEDigraph.removeNode(java.lang.Object node)


java.lang.Object MutableHashCEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)


boolean MutableHashGEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode)


int MutableHashGEDigraph.removeNode(java.lang.Object node)


boolean MutableHashGEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)


boolean AbstractHashUEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)


boolean AbstractHashUEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Returns true if edge links fromNode to toNode

int AbstractHashUEDigraph.countInboundEdges(java.lang.Object node)
          Inefficient.

int AbstractHashUEDigraph.countOutboundEdges(java.lang.Object node)
          Inefficient.

Set AbstractHashUEDigraph.getInboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no inbound edges.

Set AbstractHashUEDigraph.getOutboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no outbound edges.

java.lang.Object AbstractHashUEDigraph.getEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns null if either node is not in the digraph or if no edge links fromNode to toNode

Set AbstractHashUEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set AbstractHashUEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.

protected java.lang.Object AbstractHashUEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)


protected Set AbstractHashUEDigraph.removeNode(java.lang.Object node)


protected java.lang.Object AbstractHashUEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)


java.lang.Object MutableUEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Return null if fromNode or toNode are not in this UEDigraph, or if no existing edge is displaced by edge.

Set MutableUEDigraph.removeNode(java.lang.Object node)
          Return the Set of orphaned edges that are removed with node

java.lang.Object MutableUEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return the edge that connected fromNode to toNode, or null if no edge existed.

boolean AbstractHashCEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns true if the digraph contains any edge from fromNode to toNode

boolean AbstractHashCEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Returns true if edge links fromNode to toNode

int AbstractHashCEDigraph.countInboundEdges(java.lang.Object node)
          Inefficient.

int AbstractHashCEDigraph.countOutboundEdges(java.lang.Object node)
          Inefficient.

Set AbstractHashCEDigraph.getInboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no inbound edges.

Set AbstractHashCEDigraph.getOutboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no outbound edges.

java.lang.Object AbstractHashCEDigraph.getEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns null if either node is not in the digraph or if no edge links fromNode to toNode

Set AbstractHashCEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set AbstractHashCEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.

protected java.lang.Object AbstractHashCEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Return null if fromNode or toNode are not in this CEDigraph, or if no existing edge is displaced by edge.

protected Set AbstractHashCEDigraph.removeNode(java.lang.Object node)
          Return the Set of orphaned edges that are removed with node

protected java.lang.Object AbstractHashCEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return the edge that connected fromNode to toNode, or null if no edge existed.

boolean AbstractHashGEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)


int AbstractHashGEDigraph.countInboundEdges(java.lang.Object node)
          Inefficient.

int AbstractHashGEDigraph.countOutboundEdges(java.lang.Object node)
          Inefficient.

Set AbstractHashGEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set AbstractHashGEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.

protected boolean AbstractHashGEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return true if the digraph changes when this edge is added, false if the digraph is unchanged.

protected int AbstractHashGEDigraph.removeNode(java.lang.Object node)
          Return the number of orphaned edges that were lost when this node is removed.

protected boolean AbstractHashGEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return true if the digraph changes when the edge is removed, false if the digraph didn't have an edge between these two nodes.

java.lang.Object MutableCEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Return null if fromNode or toNode are not in this CEDigraph, or if no existing edge is displaced by edge.

Set MutableCEDigraph.removeNode(java.lang.Object node)
          Return the Set of orphaned edges that are removed with node

java.lang.Object MutableCEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return the edge that connected fromNode to toNode, or null if no edge existed.

boolean MutableGEDigraph.addEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return true if the digraph changes when this edge is added, false if the digraph is unchanged.

int MutableGEDigraph.removeNode(java.lang.Object node)
          Return the number of orphaned edges that were lost when this node is removed.

boolean MutableGEDigraph.removeEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Return true if the digraph changes when the edge is removed, false if the digraph didn't have an edge between these two nodes.

boolean UEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns true if the digraph contains any edge from fromNode to toNode

boolean UEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Returns true if edge links fromNode to toNode

int UEDigraph.countInboundEdges(java.lang.Object node)


int UEDigraph.countOutboundEdges(java.lang.Object node)


Set UEDigraph.getInboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no inbound edges.

Set UEDigraph.getOutboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no outbound edges.

java.lang.Object UEDigraph.getEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns null if either node is not in the digraph or if no edge links fromNode to toNode

Set UEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set UEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.

boolean CEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns true if the digraph contains any edge from fromNode to toNode

boolean CEDigraph.containsEdge(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          Returns true if edge links fromNode to toNode

int CEDigraph.countInboundEdges(java.lang.Object node)


int CEDigraph.countOutboundEdges(java.lang.Object node)


Set CEDigraph.getInboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no inbound edges.

Set CEDigraph.getOutboundEdges(java.lang.Object node)
          Returns the empty set if node is not in the digraph, or if node has no outbound edges.

java.lang.Object CEDigraph.getEdge(java.lang.Object fromNode, java.lang.Object toNode)
          Returns null if either node is not in the digraph or if no edge links fromNode to toNode

Set CEDigraph.getFromNodes(java.lang.Object node)
          Returns the set of nodes that can reach this node by crossing one edge.

Set CEDigraph.getToNodes(java.lang.Object node)
          Returns the set of nodes that can be reached from this node by crossing one edge.