Uses of Class org.drip.graph.core.Edge

Packages that use Edge
Package	Description
org.drip.graph.astar	A^* Heuristic Shortest Path Family
org.drip.graph.core	Vertexes, Edges, Trees, and Graphs
org.drip.graph.shortestpath	Shortest Path Generation Algorithm Family

Uses of Edge in org.drip.graph.astar

Methods in org.drip.graph.astar with parameters of type Edge
Modifier and Type	Method	Description
`boolean`	FHeuristic.`isConsistent(Network<?> graph, Edge edge)`	Indicate if the Heuristic is Consistent
`boolean`	FHeuristic.`isMonotone(Network<?> graph, Edge edge)`	Indicate if the Heuristic is Monotone
`double`	FHeuristic.`reducedWeight(Network<?> graph, Edge edge)`	Compute the Reduced Weight of the Edge

Uses of Edge in org.drip.graph.core

Methods in org.drip.graph.core that return Edge
Modifier and Type	Method	Description
`Edge`	Edge.`invert()`	Retrieve a new "Inverted" Edge
`Edge`	Tree.`maximumBottleneckEdge()`	Retrieve the Maximum Bottleneck Edge of the Tree
`Edge`	Tree.`minimumBottleneckEdge()`	Retrieve the Minimum Bottleneck Edge of the Tree

Methods in org.drip.graph.core that return types with arguments of type Edge
Modifier and Type	Method	Description
`PriorityQueue<java.lang.Double,Edge>`	Vertex.`adjacencyPriorityQueue(boolean minHeap)`	Retrieve the Ordered Adjacency Priority Queue
`java.util.Map<java.lang.String,Edge>`	CompleteBipartite.`crossConnectMap()`	Retrieve the Cross Connection Edge Map
`java.util.List<Edge>`	Vertex.`destinationEdgeList(java.lang.String sourceVertexName, java.lang.String destinationVertexName)`	Generate the List of Edges between the Source and the Destination
`java.util.List<Edge>`	Path.`edgeList()`	Retrieve the Contiguous List of Edges
`java.util.Map<java.lang.String,Edge>`	Network.`edgeMap()`	Retrieve the Edge Map
`java.util.Map<java.lang.String,Edge>`	Vertex.`edgeMap()`	Retrieve the Edge Map
`PriorityQueue<java.lang.Double,Edge>`	Tree.`edgePriorityQueue(Network<?> network, boolean minHeap)`	Construct and Retrieve the Edge Priority Queue from the Graph
`java.util.Set<Edge>`	Directed.`fundamentalCycleEdgeSet(Tree<?> tree)`	Retrieve the Set of the Fundamental Cycles using the Spanning Tree

Methods in org.drip.graph.core with parameters of type Edge
Modifier and Type	Method	Description
`boolean`	Tree.`absorbTreeAndEdge(Tree<?> tree, Edge edge)`	Absorb the Specified Tree and Edge
`boolean`	Tree.`absorbTreeAndEdge(Tree<V> tree, Edge edge, java.util.Map<java.lang.String,V> vertexValueMap)`	Absorb the Specified Tree and Edge
`boolean`	Network.`addBidirectionalEdge(Edge edge)`	Add a Bidirectional Edge to the Network
`boolean`	Network.`addBidirectionalEdge(Edge edge, java.util.Map<java.lang.String,V> vertexValueMap)`	Add a Bidirectional Edge to the Network
`boolean`	Network.`addEdge(Edge edge)`	Add an Edge to the Network
`boolean`	Network.`addEdge(Edge edge, java.util.Map<java.lang.String,V> vertexValueMap)`	Add an Edge to the Network
`java.lang.String`	Vertex.`addEdge(Edge edge)`	Add an Edge
`boolean`	Edge.`compareWith(Edge edge)`	Compare the Current Edge with the Specified One
`boolean`	Forest.`conditionalMerge(Edge edge, Directed<?> graph)`	Conditionally Merge the Specified Source and Destination Trees of the Edge
`boolean`	Network.`containsEdge(Edge edgeOther)`	Indicate if the Specified Edge matches with any Edges in the Network
`boolean`	Network.`isEdgeACycle(Edge edge)`	Indicate if the Edge forms a Cycle with the Network

Constructor parameters in org.drip.graph.core with type arguments of type Edge
Constructor	Description
`CompleteBipartite(java.util.Set<java.lang.String> vertexNameSetP, java.util.Set<java.lang.String> vertexNameSetQ, java.util.Map<java.lang.String,Edge> crossConnectMap)`	CompleteBipartite Constructor
`Path(java.util.List<Edge> edgeList)`	Path Constructor

Uses of Edge in org.drip.graph.shortestpath

Methods in org.drip.graph.shortestpath that return Edge
Modifier and Type	Method	Description
`Edge`	AugmentedVertex.`precedingEdge()`	Retrieve the Preceding Edge

Methods in org.drip.graph.shortestpath with parameters of type Edge
Modifier and Type	Method	Description
`boolean`	AugmentedVertex.`setPrecedingEdge(Edge precedingEdge)`	Set the Preceding Edge in the Path
`boolean`	VertexAugmentor.`updateAugmentedVertex(Edge precedingEdge)`	Update the Augmented Vertex through the Preceding Vertex represented in the Preceding Edge