MCPcopy Create free account

hub / github.com/Ohohcakester/Any-Angle-Pathfinding / functions

Functions1,502 in github.com/Ohohcakester/Any-Angle-Pathfinding

↓ 193 callersMethodprintln
(Object line)
src/main/AlgoTest.java:466
↓ 136 callersMethodisBlocked
(int x, int y)
src/grid/GridGraph.java:36
↓ 107 callersMethodadd
(E e)
src/algorithms/anya16/ArrayListSet.java:55
↓ 76 callersMethodtoDouble
(int n)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:37
↓ 65 callersMethodget
(int index)
src/algorithms/anya16/ArrayListSet.java:91
↓ 61 callersMethodtestOnMazeData
(String mazeName, AlgoFunction algoFunction, TestFunctionData test)
src/main/AlgoTest.java:528
↓ 59 callersMethodprintln
(StringBuilder sb, String line)
src/main/utility/TimeCounter.java:111
↓ 53 callersMethodget_cell_is_traversable
(int cx, int cy)
src/algorithms/anya16/BitpackedGrid.java:128
↓ 53 callersMethodtoOneDimIndex
(int x, int y)
src/algorithms/PathFindingAlgorithm.java:101
↓ 46 callersMethodsize
()
src/algorithms/datatypes/Memory.java:82
↓ 45 callersMethodaddNeighbour
(int x, int y)
src/algorithms/JumpPointSearch.java:343
↓ 42 callersMethodtoTwoDimX
(int index)
src/algorithms/PathFindingAlgorithm.java:105
↓ 42 callersMethodtoTwoDimY
(int index)
src/algorithms/PathFindingAlgorithm.java:109
↓ 37 callersMethodgenerate
(Integer[] path, Color color)
src/algorithms/datatypes/SnapshotItem.java:21
↓ 36 callersMethoddistance
(int index)
src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:269
↓ 35 callersMethodisWholeNumber
(double n)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:45
↓ 32 callersMethodbottomRightOfBlockedTile
(int x, int y)
src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:255
↓ 32 callersMethodtopRightOfBlockedTile
(int x, int y)
src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:247
↓ 31 callersMethodbottomLeftOfBlockedTile
(int x, int y)
src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:259
↓ 31 callersMethodtopLeftOfBlockedTile
(int x, int y)
src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:251
↓ 31 callersMethodxCoordinateOf
(int index)
src/algorithms/sparsevgs/SparseVisibilityGraph.java:220
↓ 31 callersMethodyCoordinateOf
(int index)
src/algorithms/sparsevgs/SparseVisibilityGraph.java:224
↓ 27 callersMethodparent
(int index)
src/algorithms/sg16/SG16Algorithm.java:182
↓ 26 callersMethodprintTreeLinkedList
(AVLTree<Integer> avlTree)
src/algorithms/bst/AVLTreeTest.java:130
↓ 25 callersMethoddistance
(int index)
src/algorithms/datatypes/Memory.java:86
↓ 25 callersMethodisEmpty
()
src/algorithms/bst/BinaryTree.java:349
↓ 25 callersMethodloadStoredMaze
(String mazeName, String problemName)
src/uiandio/GraphImporter.java:137
↓ 25 callersMethodround
(double n)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:57
↓ 24 callersMethodisLessThanOrEqual
(Fraction o)
src/algorithms/anya/Fraction.java:48
↓ 23 callersMethodaddParameter
(FileIO fileIO, String name, Object value)
src/main/testgen/TestDataGenerator.java:296
↓ 23 callersMethodparent
(int index)
src/algorithms/datatypes/Memory.java:91
↓ 22 callersMethodendNode
()
src/algorithms/sparsevgs/SparseVisibilityGraph.java:252
↓ 22 callersMethodmin
Returns the smallest element in the heap. This smallest element is the one with the minimum key value. <p>Running time: O(1) actual</p> @return heap
src/algorithms/jgrapht/FibonacciHeap.java:206
↓ 21 callersMethodimportGraphFromFile
Import a graph from a file in the predefinedgrids directory. Look into the GraphImporter documentation for details on how to create a grid file.
src/uiandio/GraphImporter.java:104
↓ 21 callersMethodisLessThan
(Fraction o)
src/algorithms/anya/Fraction.java:52
↓ 21 callersMethodplus
(Fraction o)
src/algorithms/anya/Fraction.java:84
↓ 20 callersMethodclose
()
src/uiandio/FileIO.java:50
↓ 20 callersMethodfloor
@return largest integer leq to this.
src/algorithms/anya/Fraction.java:103
↓ 20 callersMethodgenerateSeeded
Does not remove the block at 0,0
src/main/graphgeneration/DefaultGenerator.java:40
↓ 20 callersMethodinsert
(E data)
src/algorithms/bst/AVLTree.java:160
↓ 20 callersMethodlineOfSight
(int node1, int node2)
src/algorithms/AStar.java:151
↓ 20 callersMethodremove
(Object o)
src/algorithms/anya16/ArrayListSet.java:60
↓ 19 callersMethodgcd
(int x, int y)
src/algorithms/anya/Fraction.java:158
↓ 19 callersFunctionprintOut
(message)
pyscripts/mazes.py:35
↓ 19 callersMethodsetParent
(int index, int value)
src/algorithms/datatypes/Memory.java:112
↓ 18 callersMethodaddSuccessor
(int x, int y)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:125
↓ 18 callersMethodaddSuccessor
(int x, int y)
src/algorithms/sparsevgs/LineOfSightScanner.java:95
↓ 18 callersMethodaddToFloodFill
(int x, int y)
src/algorithms/sg16/ConvexHullSplitGenerator.java:917
↓ 18 callersMethodsetBlocked
(int x, int y, boolean value)
src/grid/GridGraph.java:27
↓ 17 callersMethodcomputePathLength
Compute the length of a given path. (Using euclidean distance)
src/main/utility/Utility.java:32
↓ 17 callersMethoddistance
(int index)
src/algorithms/sg16/SG16Algorithm.java:190
↓ 17 callersMethodgcdIterative
(int x, int y)
src/algorithms/anya/Fraction.java:181
↓ 17 callersMethodgetLeft
()
src/algorithms/anya16/AnyaInterval.java:76
↓ 17 callersMethodparent
(int index)
src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:261
↓ 16 callersMethodgetRow
()
src/algorithms/anya16/AnyaInterval.java:109
↓ 16 callersMethodisLessThanOrEqual
(double a, double b)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:39
↓ 16 callersMethodisOuterCorner
(int x, int y)
src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:202
↓ 16 callersMethodsize
()
src/algorithms/sparsevgs/SparseVisibilityGraph.java:228
↓ 16 callersMethodtryRelaxNeighbour
(int current, int currentX, int currentY, int x, int y)
src/algorithms/AStar.java:89
↓ 15 callersMethodaddLine
(int x1, int y1, int x2, int y2, Color color)
src/draw/GridLineSet.java:52
↓ 15 callersMethodceil
@return smallest integer geq to this.
src/algorithms/anya/Fraction.java:115
↓ 15 callersMethodgeneratePath
Generates a path between two points on a grid. @return an array of int[2] indicating the coordinates of the path.
src/main/utility/Utility.java:116
↓ 15 callersMethodgetData
()
src/algorithms/bst/Node.java:47
↓ 15 callersMethodgetRight
()
src/algorithms/anya16/AnyaInterval.java:93
↓ 15 callersMethodmaybeSaveSearchSnapshot
()
src/algorithms/PathFindingAlgorithm.java:113
↓ 15 callersMethodprint
()
src/main/utility/TimeCounter.java:115
↓ 14 callersMethodaddParameter
(StringBuilder sb, String name, Object value)
src/main/analysis/MazeAnalysis.java:269
↓ 14 callersMethodaddPoint
(int x, int y, Color color)
src/draw/GridPointSet.java:35
↓ 14 callersMethodclear
()
src/algorithms/anya16/ArrayListSet.java:85
↓ 13 callersMethodadd
(int keyCode, String description, Runnable function)
src/draw/VisualiserKeyboardControls.java:48
↓ 13 callersMethoddecreaseKey
(int index, float newCost, boolean isNewItem)
src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:105
↓ 13 callersMethoddistance
(int index)
src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:573
↓ 13 callersMethodgenerateDownwards
(double leftBound, double rightBound, int sx, int sy, int currY, boolean leftInclusive, boolean rightInclusive
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:1105
↓ 13 callersMethodgenerateDownwards
(Fraction leftBound, Fraction rightBound, int sx, int sy, int currY, boolean leftInclusive, boolean rightInclu
src/algorithms/sparsevgs/LineOfSightScanner.java:1075
↓ 13 callersMethodgenerateUpwards
(double leftBound, double rightBound, int sx, int sy, int currY, boolean leftInclusive, boolean rightInclusive
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:1097
↓ 13 callersMethodgenerateUpwards
(Fraction leftBound, Fraction rightBound, int sx, int sy, int currY, boolean leftInclusive, boolean rightInclu
src/algorithms/sparsevgs/LineOfSightScanner.java:1067
↓ 13 callersMethodgetLabel
(int x, int y)
src/algorithms/sg16/ConvexHullSplitGenerator.java:986
↓ 13 callersMethodhashCode
(V v)
src/algorithms/anya16/ExpansionPolicy.java:42
↓ 13 callersMethodminus
(Fraction o)
src/algorithms/anya/Fraction.java:76
↓ 13 callersMethodmultiplyDivide
(int multiply, int divide)
src/algorithms/anya/Fraction.java:64
↓ 13 callersMethodpopMinIndex
Runtime: O(lgn) @return index of min element
src/algorithms/priorityqueue/IndirectHeap.java:183
↓ 12 callersMethodisTaut
Checks whether the path v, u, p=parent(u) is taut.
src/algorithms/strictthetastar/StrictThetaStar.java:154
↓ 12 callersMethodmaybeSaveSearchSnapshot
(ConvexHullRPSScanner scanner, int currX, int currY)
src/algorithms/sg16/SG16Algorithm.java:256
↓ 12 callersMethodsize
()
src/algorithms/priorityqueue/ReusableIndirectHeap.java:300
↓ 12 callersMethodtrySetBlocked
(int x, int y, boolean value)
src/grid/GridGraph.java:31
↓ 12 callersMethodvisited
(int index)
src/algorithms/datatypes/Memory.java:96
↓ 11 callersMethoddelete
(E data)
src/algorithms/bst/AVLTree.java:271
↓ 11 callersMethodgetKey
(int index)
src/algorithms/priorityqueue/ReusableIndirectHeap.java:63
↓ 11 callersMethodinitialiseMemory
(int size, float defaultDistance, int defaultParent, boolean defaultVisited)
src/algorithms/PathFindingAlgorithm.java:53
↓ 11 callersMethodinorderToString
A method to display the inorder traversal of a binary tree placeing a left parenthesis before each subtree and a right parenthesis after each subtree.
src/algorithms/bst/BinaryTree.java:268
↓ 11 callersMethodisWholeNumber
()
src/algorithms/anya/Fraction.java:43
↓ 11 callersMethodput
(HashMap<String,String> dict, String input)
src/uiandio/GraphImporter.java:213
↓ 11 callersMethodsetDistance
(int index, float value)
src/algorithms/datatypes/Memory.java:101
↓ 11 callersMethodsize
()
src/algorithms/visibilitygraph/VisibilityGraph.java:212
↓ 10 callersMethodbottomLeftOfBlockedTile
(int x, int y)
src/algorithms/BreadthFirstSearch.java:122
↓ 10 callersMethodcoordinateOf
(int index)
src/algorithms/visibilitygraph/VisibilityGraph.java:208
↓ 10 callersMethodget_point_is_corner
(int x, int y)
src/algorithms/anya16/BitpackedGrid.java:115
↓ 10 callersMethodisBlockedRaw
(int x, int y)
src/grid/GridGraph.java:42
↓ 10 callersMethodisLessThan
(double a, double b)
src/algorithms/sparsevgs/LineOfSightScannerDouble.java:42
↓ 10 callersMethodsplit_interval_make_successors
( double max_left, double max_right, int irow, int rootx, int rooty, int sterile_check_row,
src/algorithms/anya16/AnyaExpansionPolicy.java:230
next →1–100 of 1,502, ranked by callers