Uses of Interface
com.yworks.yfiles.algorithms.IEdgeMap

Packages that use IEdgeMap

Package	Description
com.yworks.yfiles.algorithms	Provides the yFiles library's most fundamental classes and interfaces that model an efficient graph data type (class Graph), its nodes and edges (classes Node and Edge), and related container structures and iteration mechanisms (class YList and interface ICursor).
com.yworks.yfiles.layout	Provides essential classes and interfaces that constitute the infrastructure for automatic graph layout generation.
com.yworks.yfiles.layout.tree	Provides tree layout style algorithms.

Uses of IEdgeMap in com.yworks.yfiles.algorithms

Methods in com.yworks.yfiles.algorithms that return IEdgeMap

Modifier and Type	Method and Description
IEdgeMap	Graph.createEdgeMap() Returns a newly created edge map that is valid for the edges in this graph.
static IEdgeMap	Maps.createEdgeMap(Map<Object,Object> map) Create an EdgeMap view of the given map.
static IEdgeMap	Maps.createHashedEdgeMap() Creates an EdgeMap that is based on hashing.
static IEdgeMap	Maps.createIndexEdgeMap(boolean[] data) Returns a EdgeMap view of a boolean array defined for edges.
static IEdgeMap	Maps.createIndexEdgeMap(double[] data) Returns a EdgeMap view of a double array defined for edges.
static IEdgeMap	Maps.createIndexEdgeMap(double[] doubleData, int[] intData, boolean[] boolData, Object[] objectData) Returns a EdgeMap view of a double, int, boolean and Object array defined for edges.
static IEdgeMap	Maps.createIndexEdgeMap(int[] data) Returns a EdgeMap view of an int array defined for edges.
static IEdgeMap	Maps.createIndexEdgeMap(Object[] data) Returns a EdgeMap view of an Object array defined for edges.
IEdgeMap[]	Graph.getRegisteredEdgeMaps() Gets all edge maps that have been created by this graph but have not yet been disposed.

Methods in com.yworks.yfiles.algorithms with parameters of type IEdgeMap

Modifier and Type	Method and Description
static int	GraphConnectivity.biconnectedComponents(Graph graph, IEdgeMap compNum) Calculates the biconnected components and the articulation points of a given undirected graph and returns the number of biconnected components.
static int	GraphConnectivity.biconnectedComponents(Graph graph, IEdgeMap compNum, INodeMap aPoint) Calculates the biconnected components and the articulation points of a given undirected graph and returns the number of biconnected components.
static Edge	Triangulator.calcDelauneyTriangulation(Graph result, IDataProvider pointData, IEdgeMap revMap) Computes a Delauney triangulation of the given points.
static int	NetworkFlows.calcMaxFlow(Graph graph, Node source, Node sink, IDataProvider eCapDP, IEdgeMap flowEM) Solves a maximum flow problem using the preflow-push method.
static int	NetworkFlows.calcMaxFlowMinCut(Graph graph, Node source, Node sink, IDataProvider eCapDP, IEdgeMap flowEM, INodeMap sourceCutNM) Solves a maximum flow problem using the preflow-push method but additionally marks all nodes that belong to the minimum cut set that is associated with the source of the network.
void	Graph.disposeEdgeMap(IEdgeMap map) Informs the graph that the given edge map is no longer needed.
static void	Centrality.edgeBetweenness(Graph graph, IEdgeMap centrality, boolean directed, IDataProvider edgeCosts) Computes betweenness centrality for each edge of a given graph.
static void	Paths.findAllPaths(Graph graph, Node startNode, Node endNode, IEdgeMap pathEdges) Finds all edges that belong to a directed path from a start node to an end node.
static void	Cycles.findCycleEdges(Graph graph, IEdgeMap cycleEdges) Marks the edges of a given graph whose removal or reversal would make the graph acyclic while trying to minimize the cost associated with the marked edges.
static void	Cycles.findCycleEdges(Graph graph, IEdgeMap cycleEdges, IDataProvider costDP) Marks the edges of a given graph whose removal or reversal would make the graph acyclic while trying to minimize the cost associated with the marked edges.
static void	Cycles.findCycleEdgesDFS(Graph graph, IEdgeMap cycleEdges) Marks the edges of a given graph whose removal or reversal would make the graph acyclic based on a depth first search.
static void	Paths.findLongestPaths(Graph graph, Node startNode, IEdgeMap dist, INodeMap maxDist, IEdgeMap predicate) Calculates the longest path from a given node to all other node in a given directed acyclic graph.
static boolean	Paths.findPath(Graph graph, NodeList topSort, Node startNode, Node endNode, IEdgeMap predicate) Returns whether or not a directed path from a start node to another node in an acyclic graph exists.
static void	ShortestPaths.findShortestUniformPaths(Graph graph, Node start, Node end, boolean directed, IEdgeMap pathMap) Marks all edges that belong to a shortest path from start node to target node.
static int	NetworkFlows.minCostFlow(Graph graph, IDataProvider lCapDP, IDataProvider uCapDP, IDataProvider cost0DP, IDataProvider supplyDP, IEdgeMap flowEM, INodeMap dualsNM) Solves a minimum cost flow problem with a capacity scaling algorithm.
static int	NetworkFlows.minCostFlow(Graph graph, IDataProvider uCapDP, IDataProvider cost0DP, IDataProvider supplyDP, IEdgeMap flowEM, INodeMap dualsNM) Uses method NetworkFlows.minCostFlow(Graph, IDataProvider, IDataProvider, IDataProvider, IDataProvider, IEdgeMap, INodeMap) to solve a minimum cost flow problem.
static int	NetworkFlows.minCostFlow(Graph graph, Node s, Node t, IDataProvider uCapDP, IDataProvider cost0DP, IEdgeMap flowEM, INodeMap dualsNM) Solves a minimum cost maximum flow problem.
static void	Centrality.nodeEdgeBetweenness(Graph graph, INodeMap nodeCentrality, IEdgeMap edgeCentrality, boolean directed, IDataProvider edgeCosts) Computes betweenness centrality for each node and edge of a given graph.
static void	Centrality.normalize(Graph graph, IEdgeMap map) Normalizes the double values of a given IEdgeMap by dividing each of them by the maximum of all values (maximum norm).
static int	RankAssignments.simple(Graph graph, INodeMap rank, IEdgeMap minLength) This method quickly calculates a tight tree given a maximum time duration for the algorithm.
static int	RankAssignments.simple(Graph graph, INodeMap rank, IEdgeMap minLength, long maximalDuration) This method quickly calculates a tight tree given a maximum time duration for the algorithm.
static int	RankAssignments.simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength, IEdgeMap tree, Node _root, boolean validRanking) Similar to RankAssignments.simplex(Graph, INodeMap, IDataProvider, IDataProvider, long) but, additionally, it is possible to provide a valid initial tree solution for the problem.
static int	RankAssignments.simplex(Graph graph, INodeMap layer, IDataProvider w, IDataProvider minLength, IEdgeMap tree, Node _root, boolean validRanking, long maximalDuration) Similar to RankAssignments.simplex(Graph, INodeMap, IDataProvider, IDataProvider, long) but, additionally, it is possible to provide a valid initial tree solution for the problem.
static EdgeList[]	GraphConnectivity.toEdgeListArray(Graph graph, IEdgeMap compNum, int maxCompNum) Transforms the return values of GraphConnectivity.biconnectedComponents(Graph, IEdgeMap, INodeMap) to an array of EdgeLists, like it is returned by GraphConnectivity.biconnectedComponents(Graph).
static Edge	Triangulator.triangulatePoints(Graph result, IDataProvider pointData, IEdgeMap reverseEdgeMap) Computes a triangulation of the given points.
static Edge	Triangulator.triangulatePoints(YList points, Graph result, INodeMap resultMap, IEdgeMap reverseEdgeMap) Computes a triangulation of the given points.

Uses of IEdgeMap in com.yworks.yfiles.layout

Fields in com.yworks.yfiles.layout declared as IEdgeMap

Modifier and Type	Field and Description
protected IEdgeMap	DefaultLayoutGraph.edgeLabelMap An IEdgeMap associating IEdgeLabelLayouts with the edges of this graph.
IEdgeMap	ParallelEdgeRouter.parallelEdges IEdgeMap that associates a hidden edge with the unique parallel edge not hidden from the core layout algorithm.

Methods in com.yworks.yfiles.layout that return IEdgeMap

Modifier and Type	Method and Description
<V> IEdgeMap	YGraphAdapter.createEdgeMap(Function<IEdge,V> getter) Creates an IEdgeMap that delegates to the provided delegate when queried for Edges in the YGraph.
<V> IEdgeMap	YGraphAdapter.createEdgeMap(IMapper<IEdge,V> mapper) Creates an IEdgeMap that delegates to the provided IMapper when queried for Edges in the YGraph.

Methods in com.yworks.yfiles.layout with parameters of type IEdgeMap

Modifier and Type	Method and Description
<T> IMapper<IEdge,T>	YGraphAdapter.createMapper(IEdgeMap edgeMap) Creates an IMapper that delegates to the provided IEdgeMap when queried for items in the IGraph.
void	PortConstraintConfigurator.createPortConstraintsFromSketch(LayoutGraph graph, IEdgeCursor ec, IEdgeMap spcMap, boolean strongSP, IEdgeMap tpcMap, boolean strongTP) Creates PortConstraints for some edges of the given graph.
void	PortConstraintConfigurator.createPortConstraintsFromSketch(LayoutGraph graph, IEdgeMap spcMap, IEdgeMap tpcMap) Creates weak PortConstraints for all edges of the given graph.
protected void	ParallelEdgeRouter.layoutParallelEdges(LayoutGraph graph, IEdgeMap parallelEdges) Assigns a layout to all parallel edges.

Uses of IEdgeMap in com.yworks.yfiles.layout.tree

Methods in com.yworks.yfiles.layout.tree with parameters of type IEdgeMap

Modifier and Type	Method and Description
protected void	TreeReductionStage.routeNonTreeEdges(LayoutGraph graph, IEdgeMap nonTreeEdgeMap) Routes all edges that do not belong to the chosen spanning tree.