Uses of Class
org.jgrapht.util.DoublyLinkedList
Packages that use DoublyLinkedList
Package
Description
Algorithms dealing with various connectivity aspects of a graph.
Algorithms for testing planarity of the graphs
Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
-
Uses of DoublyLinkedList in org.jgrapht.alg.connectivity
Fields in org.jgrapht.alg.connectivity declared as DoublyLinkedListModifier and TypeFieldDescription(package private) DoublyLinkedList<TreeDynamicConnectivity<T>.Arc> TreeDynamicConnectivity.Node.arcsArcs list -
Uses of DoublyLinkedList in org.jgrapht.alg.planar
Fields in org.jgrapht.alg.planar declared as DoublyLinkedListModifier and TypeFieldDescription(package private) DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V, E>.Edge> BoyerMyrvoldPlanarityInspector.Node.embeddedThe list of the embedded edges incident to this node in a clockwise or a counterclockwise order.(package private) DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.Node.pertinentRootsThe roots of the pertinent components during the processing of the node $v$.(package private) DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.Node.separatedDfsChildListThe list containing the dfs children of this node, which are in the different child biconnected component, i.e.Methods in org.jgrapht.alg.planar with parameters of type DoublyLinkedListModifier and TypeMethodDescription(package private) voidBoyerMyrvoldPlanarityInspector.Node.mergeChildEdges(DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges, int vIn, int vOut, BoyerMyrvoldPlanarityInspector<V, E>.Node parentNext, BoyerMyrvoldPlanarityInspector<V, E>.Edge parentEdge) Merges the embedded edges of the child component root into this node's embedded edges. -
Uses of DoublyLinkedList in org.jgrapht.util
Fields in org.jgrapht.util declared as DoublyLinkedListMethods in org.jgrapht.util with parameters of type DoublyLinkedListModifier and TypeMethodDescriptionvoidDoublyLinkedList.append(DoublyLinkedList<E> movedList) Appends themovedListto the end of this list.private voidDoublyLinkedList.linkListIntoThisBefore(int index, DoublyLinkedList<E> list) Insert non nulllistbefore node atindexinto the list.private voidDoublyLinkedList.moveAllListNodes(DoublyLinkedList<E> list) Atomically moves allListNodesfromlistto this list as if each node was removed withDoublyLinkedList.removeListNode(ListNodeImpl)fromlistand subsequently added to this list byDoublyLinkedList.addListNode(ListNodeImpl).voidDoublyLinkedList.moveFrom(int index, DoublyLinkedList<E> movedList) Moves allListNodesof the givensourceListto this list and inserts them all before the node previously at the given position.voidDoublyLinkedList.prepend(DoublyLinkedList<E> movedList) Prepends themovedListto the beginning of this list.