Uses of Class
org.graph4j.Edge

Packages that use Edge

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.
org.graph4j.flow	Algorithms related to flows in transportation networks.
org.graph4j.isomorphism	Algorithms for testing graph isomorphism.
org.graph4j.matching	Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
org.graph4j.spanning	Minimum spanning tree algorithms, such as Prim's and Kruskal's.
org.graph4j.util	Utility classes, such as apecialized collection for vertices and edges.

Uses of Edge in org.graph4j

Fields in org.graph4j with type parameters of type Edge

Modifier and Type	Field	Description
protected final List<Edge>	GraphBuilderBase.edges
protected final List<Edge>	GraphBuilderBase.edges

Methods in org.graph4j that return Edge

Modifier and Type	Method	Description
Edge<E>	Graph.edge(int v, int u)	Returns an Edge object corresponding to the specified vertices (its endpoints).
Edge	NeighborIterator.edge()
Edge	PredecessorIterator.edge()
Edge[]	Graph.edges()	Creates and returns an array holding all the edges of the graph.
Edge[]	Graph.edgesOf(int v)	Creates and returns an array holding the edges incident to a specified vertex.
Edge<E>	Edge.flip()	Flips source and target, for directed edges.
default Edge[]	Digraph.incomingEdgesTo(int v)	Creates an array holding the edges incoming to a vertex.
Edge<E>	EdgeIterator.next()	Returns the next edge in the iteration.
default Edge[]	Digraph.outgoingEdgesFrom(int v)	Creates an array holding the edges outgoing from a vertex.

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

Modifier and Type	Method	Description
static Digraph<Edge,Object>	GraphUtils.createLineGraph(Digraph digraph)	Creates the line graph of a directed graph.
static Graph<Edge,Object>	GraphUtils.createLineGraph(Graph graph)	Creates the line graph of an undirected graph.

Methods in org.graph4j with parameters of type Edge

Modifier and Type	Method	Description
int	Graph.addEdge(Edge<E> e)	Adds a new edge to the graph.
GraphBuilder	GraphBuilder.addEdge(Edge e)
NetworkBuilder	NetworkBuilder.addEdge(Edge e)
int	Edge.compareTo(Edge o)
default boolean	Graph.containsEdge(Edge e)	Checks if an edge belongs to the graph.
boolean	Edge.isAdjacentTo(Edge other)
default int	Multigraph.multiplicity(Edge e)
default void	Graph.removeEdge(Edge e)	Removes the specified edge from the graph.

Method parameters in org.graph4j with type arguments of type Edge

Modifier and Type	Method	Description
static double	GraphUtils.computeWeight(Graph graph, Collection<Edge> edges)	Computes the sum of the weights of the edges in a specified collection
static VertexSet	GraphUtils.getVertices(Graph graph, Collection<Edge> edges)	Determines the set of distinct vertices belonging to a collection of edges.
Digraph<V,E>	Digraph.subgraph(Collection<Edge> edges)
DirectedMultigraph<V,E>	DirectedMultigraph.subgraph(Collection<Edge> edges)
DirectedPseudograph<V,E>	DirectedPseudograph.subgraph(Collection<Edge> edges)
Graph<V,E>	Graph.subgraph(Collection<Edge> edges)	Creates and returns the subgraph generated by a collection of edges.
Multigraph<V,E>	Multigraph.subgraph(Collection<Edge> edges)
Network<V,E>	Network.subgraph(Collection<Edge> edges)
Pseudograph<V,E>	Pseudograph.subgraph(Collection<Edge> edges)

Uses of Edge in org.graph4j.flow

Methods in org.graph4j.flow that return types with arguments of type Edge

Modifier and Type	Method	Description
Set<Edge>	FlowData.edges()

Methods in org.graph4j.flow with parameters of type Edge

Modifier and Type	Method	Description
double	FlowData.get(Edge e)
default double	MaximumFlowAlgorithm.getFlowValue(Edge e)	Returns the value of the maximum flow on the specified edge.
void	FlowData.put(Edge e, double value)

Uses of Edge in org.graph4j.isomorphism

Methods in org.graph4j.isomorphism that return Edge

Modifier and Type	Method	Description
Edge	OrderedDigraph.getEdge(int vertexIndex1, int vertexIndex2)

Uses of Edge in org.graph4j.matching

Constructor parameters in org.graph4j.matching with type arguments of type Edge

Modifier	Constructor	Description
	GreedyWeightedMatching(Graph graph, Comparator<Edge> comparator)	Creates a maximal matching algorithm that iterates over the edges of the graph in the order given by a specified comparator.
	MaximalCardinalityMatching(Graph graph, Comparator<Edge> comparator)	Creates a maximal matching algorithm that iterates over the edges of the graph in the order given by a specified comparator.This method has O(m + m log n) time complexity.

Uses of Edge in org.graph4j.spanning

Fields in org.graph4j.spanning declared as Edge

Modifier and Type	Field	Description
protected final Edge[]	BoruvkaMinimumSpanningTreeBase.cheapest
protected final Edge[]	WeightedSpanningTreeIterator.edges

Methods in org.graph4j.spanning that return types with arguments of type Edge

Modifier and Type	Method	Description
Collection<Edge>	SpanningTreeIterator.next()
Collection<Edge>	WeightedSpanningTreeIterator.next()

Uses of Edge in org.graph4j.util

Methods in org.graph4j.util that return types with arguments of type Edge

Modifier and Type	Method	Description
Set<Edge>	Matching.edges()

Methods in org.graph4j.util with parameters of type Edge

Modifier and Type	Method	Description
boolean	EdgeArray.add(Edge e)	Deprecated. Adds an edge to the collection.
protected void	Walk.checkEdge(Edge e)
static void	Validator.containsEdge(Graph graph, Edge e)	Checks if a graph contains an edge.
boolean	EdgeArray.remove(Edge e)	Deprecated. Removes an edge from the collection.

Constructors in org.graph4j.util with parameters of type Edge

Modifier	Constructor	Description
	EdgeArray(Graph graph, Edge[] edges)	Deprecated.
	EdgeSet(Graph graph, Edge[] edges)	Constructs a new set containing the elements in the specified array.

Constructor parameters in org.graph4j.util with type arguments of type Edge

Modifier	Constructor	Description
	EdgeSet(Graph graph, Collection<Edge> edges)	Constructs a new set containing the elements in the specified collection.