Java com.google.common.graph Network fields, constructors, methods, implement or subclass

Introduction

In this page you can find the methods, fields and constructors for com.google.common.graph Network.

The text is from its open source code.

com.google.common.graph.Network has the following implementations.
Click this link to see all its implementation.

Set	adjacentNodes(Object node) Returns the nodes which have an #incidentEdges(Object) incident edge in common with node in this graph.
boolean	allowsSelfLoops() Returns true if this graph allows self-loops (edges that connect a node to itself).
Set	edges() Returns all edges in this network.
Set	edgesConnecting(Object node1, Object node2) Returns the set of edges that connect node1 to node2 .
Set	incidentEdges(Object node) Returns the edges whose endpoints in this graph include node .
Set	incidentNodes(Object edge) Returns the nodes which are the endpoints of edge in this graph.
int	inDegree(Object node) Returns the number of #inEdges(Object) incoming edges in this graph of node .
boolean	isDirected() Returns true if each edge in this graph is directed.
Set	nodes() Returns all nodes in this graph.
int	outDegree(Object node) Returns the number of #outEdges(Object) outgoing edges in this graph of node .
Set	outEdges(Object node) Returns all edges in this graph which can be traversed in the direction (if any) of the edge starting from node .
Set	predecessors(Object node) Returns all nodes in this graph adjacent to node which can be reached by traversing node 's #inEdges(Object) incoming edges against the direction (if any) of the edge.
Set	successors(Object node) Returns all nodes in this graph adjacent to node which can be reached by traversing node 's #outEdges(Object) outgoing edges in the direction (if any) of the edge.