Generated by
JDiff

Interface com.google.common.graph.Network

Removed interfaces com.google.common.graph.PredecessorsFunction, com.google.common.graph.SuccessorsFunction.
Added interface com.google.common.graph.ArchetypeGraph.

Removed Methods
Set<N> adjacentNodes(N) Returns a live view of the nodes which have an incident edge in common with {@code node} in this graph.
boolean allowsSelfLoops() Returns true if this network allows self-loops (edges that connect a node to itself).
boolean isDirected() Returns true if the edges in this network are directed.
ElementOrder<N> nodeOrder() Returns the order of iteration for the elements of .nodes().
Set<N> nodes() Returns all nodes in this network, in the order specified by .nodeOrder().
Set<N> predecessors(N) Returns a live view of all nodes in this network adjacent to {@code node} which can be reached by traversing {@code node}'s incoming edges against the direction (if any) of the edge.
Set<N> successors(N) Returns a live view of all nodes in this network adjacent to {@code node} which can be reached by traversing {@code node}'s outgoing edges in the direction (if any) of the edge.