Uses of Record Class
cloud.opencode.base.graph.node.Edge

Packages that use Edge

Package	Description
cloud.opencode.base.graph
cloud.opencode.base.graph.algorithm
cloud.opencode.base.graph.builder
cloud.opencode.base.graph.node

Uses of Edge in cloud.opencode.base.graph

Methods in cloud.opencode.base.graph that return types with arguments of type Edge

Modifier and Type	Method	Description
Set<Edge<V>>	GraphDiff.DiffResult.addedEdges()	Returns the value of the addedEdges record component.
static <V> Set<Edge<V>>	OpenGraph.bridges(Graph<V> graph)	Find all bridges (cut edges) 查找所有桥（割边）
Set<Edge<V>>	GraphDiff.DiffResult.commonEdges()	Returns the value of the commonEdges record component.
Set<Edge<V>>	DirectedGraph.edges()
Set<Edge<V>>	Graph.edges()	Get all edges 获取所有边
Set<Edge<V>>	ImmutableGraph.edges()
Set<Edge<V>>	UndirectedGraph.edges()
default Set<Edge<V>>	WeightedGraph.edgesInWeightRange(double minWeight, double maxWeight)	Get edges with weight in range 获取权重在范围内的边
static <V> Map<Edge<V>,Double>	OpenGraph.getFlows(Graph<V> graph, V source, V sink)	Get flow on each edge 获取每条边上的流量
Set<Edge<V>>	DirectedGraph.inEdges(V vertex)
Set<Edge<V>>	Graph.inEdges(V vertex)	Get incoming edges to a vertex 获取顶点的入边
Set<Edge<V>>	ImmutableGraph.inEdges(V vertex)
Set<Edge<V>>	UndirectedGraph.inEdges(V vertex)
static <V> Set<Edge<V>>	OpenGraph.kruskal(Graph<V> graph)	Find minimum spanning tree using Kruskal's algorithm 使用Kruskal算法查找最小生成树
static <V> Set<Edge<V>>	OpenGraph.minCut(Graph<V> graph, V source, V sink)	Find minimum cut edges 查找最小割边
Set<Edge<V>>	DirectedGraph.outEdges(V vertex)
Set<Edge<V>>	Graph.outEdges(V vertex)	Get outgoing edges from a vertex 获取顶点的出边
Set<Edge<V>>	ImmutableGraph.outEdges(V vertex)
Set<Edge<V>>	UndirectedGraph.outEdges(V vertex)
static <V> Set<Edge<V>>	OpenGraph.prim(Graph<V> graph)	Find minimum spanning tree using Prim's algorithm 使用Prim算法查找最小生成树
static <V> Set<Edge<V>>	OpenGraph.prim(Graph<V> graph, V start)	Find minimum spanning tree using Prim's algorithm starting from a vertex 使用Prim算法从指定顶点开始查找最小生成树
Set<Edge<V>>	GraphDiff.DiffResult.removedEdges()	Returns the value of the removedEdges record component.

Method parameters in cloud.opencode.base.graph with type arguments of type Edge

Modifier and Type	Method	Description
static <V> Graph<V>	GraphTransform.filterEdges(Graph<V> graph, Predicate<Edge<V>> predicate)	Filter edges, keeping all vertices but only edges matching the predicate 过滤边，保留所有顶点但仅保留匹配谓词的边
static <V> Graph<V>	OpenGraph.filterEdges(Graph<V> graph, Predicate<Edge<V>> predicate)	Filter edges from a graph by predicate 按谓词过滤图的边

Uses of Edge in cloud.opencode.base.graph.algorithm

Methods in cloud.opencode.base.graph.algorithm that return types with arguments of type Edge

Modifier and Type	Method	Description
Map<Edge<V>,Double>	NetworkFlowUtil.FlowResult.edgeFlows()	Returns the value of the edgeFlows record component.
static <V> Set<Edge<V>>	ArticulationPointUtil.findBridges(Graph<V> graph)	Find all bridges (cut edges) in the graph.
static <V> Map<Edge<V>,Double>	NetworkFlowUtil.getFlows(Graph<V> graph, V source, V sink)	Get flow on each edge 获取每条边上的流量
static <V> Set<Edge<V>>	MinimumSpanningTreeUtil.kruskal(Graph<V> graph)	Find minimum spanning tree using Kruskal's algorithm 使用Kruskal算法查找最小生成树
Set<Edge<V>>	NetworkFlowUtil.FlowResult.minCut()	Returns the value of the minCut record component.
static <V> Set<Edge<V>>	NetworkFlowUtil.minCut(Graph<V> graph, V source, V sink)	Find minimum cut edges 查找最小割边
static <V> Set<Edge<V>>	MinimumSpanningTreeUtil.minimumSpanningForest(Graph<V> graph)	Find minimum spanning forest for disconnected graph 为不连通图查找最小生成森林
static <V> Set<Edge<V>>	MinimumSpanningTreeUtil.prim(Graph<V> graph)	Find minimum spanning tree using Prim's algorithm (auto-select start) 使用Prim算法查找最小生成树（自动选择起点）
static <V> Set<Edge<V>>	MinimumSpanningTreeUtil.prim(Graph<V> graph, V start)	Find minimum spanning tree using Prim's algorithm 使用Prim算法查找最小生成树

Method parameters in cloud.opencode.base.graph.algorithm with type arguments of type Edge

Modifier and Type	Method	Description
static <V> Graph<V>	SubgraphUtil.edgeInduced(Graph<V> graph, Set<Edge<V>> edges)	Create edge-induced subgraph.
static <V> Graph<V>	SubgraphUtil.filterEdges(Graph<V> graph, Predicate<Edge<V>> predicate)	Filter graph by edge predicate.
static <V> double	MinimumSpanningTreeUtil.totalWeight(Set<Edge<V>> edges)	Calculate the total weight of a set of edges 计算边集合的总权重

Constructor parameters in cloud.opencode.base.graph.algorithm with type arguments of type Edge

Modifier	Constructor	Description
	FlowResult(double maxFlow, Map<Edge<V>,Double> edgeFlows, Set<Edge<V>> minCut)	Creates an instance of a FlowResult record class.
	FlowResult(double maxFlow, Map<Edge<V>,Double> edgeFlows, Set<Edge<V>> minCut)	Creates an instance of a FlowResult record class.

Uses of Edge in cloud.opencode.base.graph.builder

Methods in cloud.opencode.base.graph.builder with parameters of type Edge

Modifier and Type	Method	Description
GraphBuilder<V>	GraphBuilder.addEdge(Edge<V> edge)	Add an edge 添加边

Method parameters in cloud.opencode.base.graph.builder with type arguments of type Edge

Modifier and Type	Method	Description
GraphBuilder<V>	GraphBuilder.addEdges(Collection<Edge<V>> edges)	Add multiple edges 添加多个边

Uses of Edge in cloud.opencode.base.graph.node

Methods in cloud.opencode.base.graph.node that return Edge

Modifier and Type	Method	Description
Edge<V>	Edge.reversed()	Create a reversed edge 创建反向边
Edge<V>	Edge.withWeight(double newWeight)	Create an edge with a new weight 创建具有新权重的边