Uses of Interface
com.jgraph.algebra.cost.JGraphCostFunction
Packages that use JGraphCostFunction
Package
Description
JGraphLayout algebra package which contains graph algorithms and datastructures.
JGraphLayout cost package defines a cost function and default implementations.
JGraphLayout's topmost package which contains the basic layout classes and interfaces.
-
Uses of JGraphCostFunction in com.jgraph.algebra
Methods in com.jgraph.algebra with parameters of type JGraphCostFunctionModifier and TypeMethodDescriptionObject[]JGraphAlgebra.getMinimumSpanningTree(GraphModel model, Object[] v, JGraphCostFunction cf, boolean directed) Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).Object[]JGraphAlgebra.getMinimumSpanningTree(GraphModel model, Object[] v, Object[] e, JGraphCostFunction cf) Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).Object[]JGraphAlgebra.getShortestPath(GraphModel model, Object from, Object to, JGraphCostFunction cf, int steps, boolean directed) Returns the shortest path between two cells or their descendants represented as an array of edges in order of traversal.JGraphAlgebra.sort(Object[] cells, JGraphCostFunction cf) Returns a sorted set forcellswith respect tocf.doubleJGraphAlgebra.sum(Object[] cells, JGraphCostFunction cf) Returns the sum of all cost forcellswith respect tocf. -
Uses of JGraphCostFunction in com.jgraph.algebra.cost
Classes in com.jgraph.algebra.cost that implement JGraphCostFunctionModifier and TypeClassDescriptionclassThis allows to recursively compose any number of abstract layouts into a compound abstract layout.classThis class implements a priority queue. -
Uses of JGraphCostFunction in com.jgraph.layout
Fields in com.jgraph.layout declared as JGraphCostFunctionModifier and TypeFieldDescriptionprotected JGraphCostFunctionJGraphFacade.distanceCostFunctionThe default cost function used for shortest path search.Methods in com.jgraph.layout with parameters of type JGraphCostFunctionModifier and TypeMethodDescriptionObject[]JGraphFacade.getMinimumSpanningTree(Object[] v, JGraphCostFunction cf) Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).Object[]JGraphFacade.getPath(Object v1, Object v2, int steps, JGraphCostFunction cf) Returns the shortest path connectingv1andv2wrtcfwith traverses no more thanstepsedges.Constructors in com.jgraph.layout with parameters of type JGraphCostFunctionModifierConstructorDescriptionJGraphFacade(GraphLayoutCache cache, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra) Creates a JGraphFacade specifying the graph passed in as the input graph.JGraphFacade(GraphModel model, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra) Creates a JGraphGenericFacade specifying the graph passed in as the input graph.JGraphFacade(GraphModel model, GraphLayoutCache cache, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra) Creates a JGraphGenericFacade specifying the graph passed in as the input graph.JGraphFacade(JGraph graph, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra) Creates a JGraphGraphFacade specifying the graph passed in as the input graph.JGraphModelFacade(GraphModel model, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra) Creates a JGraphGraphFacade specifying the graph passed in as the input graph.