Package com.jgalgo.alg

Interface TreePathMaxima.IResult

All Superinterfaces:

TreePathMaxima.Result<Integer,Integer>

Enclosing interface:

TreePathMaxima

public static interface TreePathMaxima.IResult
extends TreePathMaxima.Result<Integer,Integer>

A result object for TreePathMaxima algorithm for IntGraph.

Author:

Barak Ugav

Method Summary

Modifier and Type	Method	Description
default Integer	getHeaviestEdge(int queryIdx)	Deprecated.
int	getHeaviestEdgeInt(int queryIdx)	Get the heaviest edge found for a single query.

Methods inherited from interface com.jgalgo.alg.TreePathMaxima.Result

size

Method Detail

getHeaviestEdgeInt

int getHeaviestEdgeInt(int queryIdx)

Get the heaviest edge found for a single query.

This result object was obtained by calling TreePathMaxima.computeHeaviestEdgeInTreePaths(Graph, WeightFunction, Queries), which accept a set of multiple queries using the TreePathMaxima.IQueries object. This method return the answer to a single queries among them, by its index.

Parameters:

queryIdx - the index of the query \((u, v)\) in the TreePathMaxima.IQueries object passed to TreePathMaxima.computeHeaviestEdgeInTreePaths(Graph, WeightFunction, Queries)

Returns:

the edge identifier of the heaviest on the path from \(u\) to \(v\) (the query vertices) in the tree passed to the algorithm, or -1 if no such path exists

getHeaviestEdge

@Deprecated
default Integer getHeaviestEdge(int queryIdx)

Deprecated.

Description copied from interface: TreePathMaxima.Result

Get the heaviest edge found for a single query.

This result object was obtained by calling TreePathMaxima.computeHeaviestEdgeInTreePaths(Graph, WeightFunction, Queries), which accept a set of multiple queries using the TreePathMaxima.IQueries object. This method return the answer to a single queries among them, by its index.

Specified by:

getHeaviestEdge in interface TreePathMaxima.Result<Integer,Integer>

Parameters:

queryIdx - the index of the query \((u, v)\) in the TreePathMaxima.IQueries object passed to TreePathMaxima.computeHeaviestEdgeInTreePaths(Graph, WeightFunction, Queries)

Returns:

the edge identifier of the heaviest on the path from \(u\) to \(v\) (the query vertices) in the tree passed to the algorithm, or -1 if no such path exists