Uses of Class
org.nongnu.multigraph.Edge

Packages that use Edge

Package	Description
org.nongnu.multigraph
org.nongnu.multigraph.perturb
org.nongnu.multigraph.structure

Uses of Edge in org.nongnu.multigraph

Methods in org.nongnu.multigraph that return Edge

Modifier and Type	Method and Description
Edge<N,E>	PartitionGraph.edge(N from, N to)
Edge<N,E>	SyncGraph.edge(N from, N to)
Edge<N,E>	Graph.edge(N from, N to) Find the first edge from a node to another node.
Edge<N,E>	MultiDiGraph.edge(N from, N to)
Edge<N,E>	PartitionGraph.edge(N from, N to, E label)
Edge<N,E>	SyncGraph.edge(N from, N to, E label)
Edge<N,E>	Graph.edge(N from, N to, E label) Find the edge with the given label, from the one node to another node, if it exists.
Edge<N,E>	MultiDiGraph.edge(N from, N to, E label)

Methods in org.nongnu.multigraph that return types with arguments of type Edge

Modifier and Type	Method and Description
java.util.Set<Edge<N,E>>	PartitionGraph.edges(N from)
java.util.Set<Edge<N,E>>	SyncGraph.edges(N from)
java.util.Set<Edge<N,E>>	Graph.edges(N from)
java.util.Set<Edge<N,E>>	MultiDiGraph.edges(N from)
java.util.Collection<Edge<N,E>>	PartitionGraph.edges(N from, N to)
java.util.Collection<Edge<N,E>>	SyncGraph.edges(N from, N to)
java.util.Collection<Edge<N,E>>	Graph.edges(N from, N to) Find the edges going from one node to another node.
java.util.Collection<Edge<N,E>>	MultiDiGraph.edges(N from, N to)
java.util.List<Edge<N,E>>	ShortestPathFirst.path(N to) Return the path from the root node to the 'to' node, as a List of Edges, in the current SPF tree.
java.lang.Iterable<Edge<N,E>>	PartitionGraph.random_edge_iterable(N n)
java.lang.Iterable<Edge<N,E>>	SyncGraph.random_edge_iterable(N n)
java.lang.Iterable<Edge<N,E>>	Graph.random_edge_iterable(N n) Provide a random-access Iterable over the <Edge<N,E>>-edges from the given node.
java.lang.Iterable<Edge<N,E>>	MultiDiGraph.random_edge_iterable(N n)

Uses of Edge in org.nongnu.multigraph.perturb

Methods in org.nongnu.multigraph.perturb that return types with arguments of type Edge

Modifier and Type	Method and Description
java.util.List<Edge<N,E>>	RemoveAddEach.last_removed_edges()
java.util.List<Edge<N,E>>	perturber.perturb() Carry out 1 iteration of the perturbation of the graph, according to the policy of the implementation.
java.util.List<Edge<N,E>>	RandomRemove.perturb() Carry out another iteration of random-removes by restoring any previously removed edges, clearing the removed_edge set, and then removing the next random set of edges.
java.util.List<Edge<N,E>>	RemoveAddEach.perturb() Carry out 1 perturbation of the graph, either removing the next group of of edges from the graph, or adding back the group of edges removed in the previous iteration.
java.util.List<Edge<N,E>>	RandomRemove.remove() Randomly remove edges from the graph, up to the specified number of edges for the class.
java.util.List<Edge<N,E>>	perturber.removed_edges()
java.util.List<Edge<N,E>>	RandomRemove.removed_edges()
java.util.List<Edge<N,E>>	RemoveAddEach.removed_edges()

Uses of Edge in org.nongnu.multigraph.structure

Methods in org.nongnu.multigraph.structure with parameters of type Edge

Modifier and Type	Method and Description
void	graph_diff.edge_callback.action(Edge<N,E> edge, graph_diff.change_state s)