Functions — github.com/Ohohcakester/Any-Angle-Pathfinding

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

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

⨍ Functions 1,502◇ Types & classes 152

(GridGraph gridGraph, int sx, int sy, int ex, int ey)

src/main/analysis/ProblemAnalysis.java:62

↓ 2 callersMethodcomputeMaxDownLeftRanges

Used by Accelerated A and MazeAnalysis. leftRange is the number of blocks you can move left before hitting a blocked tile. downRange is the number of

src/grid/GridGraph.java:323

↓ 2 callersMethodcomputeNumSkipEdges

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:964

↓ 2 callersMethodcomputePath

()

src/algorithms/Anya.java:41

↓ 2 callersMethodcomputeReachable

Computes the set of all nodes reachable from (sx,sy) by an unblocked path. @param graph the grid to use. @param sx x-coordinate of root node @param sy

src/grid/ReachableNodes.java:22

↓ 2 callersMethodcomputeSearchSnapshot

()

src/algorithms/PathFindingAlgorithm.java:164

↓ 2 callersMethodcomputeSearchSnapshot

()

src/algorithms/sg16/SG16Algorithm.java:249

↓ 2 callersMethodcomputeWeight

(int x1, int y1, int x2, int y2)

src/algorithms/visibilitygraph/VisibilityGraph.java:160

↓ 2 callersMethodcomputerMinMapCoverage

(double shortestPathLength, int sizeX, int sizeY)

src/main/analysis/ProblemAnalysis.java:93

↓ 2 callersMethodconductProblemAnalysis

(GridGraph gridGraph, ArrayList<TwoPoint> twoPointList)

src/main/analysis/MazeAnalyser.java:53

↓ 2 callersMethodcut

The reverse of the link operation: removes x from the child list of y. This method assumes that min is non-null. <p>Running time: O(1)</p> @param x

src/algorithms/jgrapht/FibonacciHeap.java:517

↓ 2 callersMethoddecreaseKey

Runtime: O(lgn)

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:165

↓ 2 callersMethoddigitToChar

(int d)

src/main/testgen/Stringifier.java:116

↓ 2 callersMethoddisplayLast

()

src/draw/KeyToggler.java:97

↓ 2 callersMethoddisplayTextVisualisation

(GridGraph gridGraph, StartGoalPoints p, String textData)

src/main/TextOutputVisualisation.java:54

↓ 2 callersMethoddistance

x1,y1,x2,y2 refer to the top left corner of the tile. @param x1 Condition: x1 between 0 and sizeX inclusive. @param y1 Condition: y1 between 0 and siz

src/grid/GridGraph.java:99

↓ 2 callersMethoddistance_double

(int x1, int y1, int x2, int y2)

src/grid/GridGraph.java:118

↓ 2 callersMethoddrawLine

(Graphics g, GridLineSet.Line line)

src/draw/GridLineDrawer.java:66

↓ 2 callersMethoddrawPath

(int[][] path)

src/draw/EditorUI.java:154

↓ 2 callersMethodenqueue

(int x, int y)

src/grid/BlockedIslandSearch.java:54

↓ 2 callersMethodenqueue

(int x, int y)

src/grid/ReachableNodesFast.java:66

↓ 2 callersMethodequals

(Object obj)

src/main/analysis/TwoPoint.java:15

↓ 2 callersMethodequals

Tests if this vertex is equal to another @param o @return

src/algorithms/anya16/BaseVertex.java:81

↓ 2 callersFunctionexecCommand

(args)

pyscripts/mazes.py:425

↓ 2 callersMethodexpand

(int currIndex, int currX, int currY)

src/algorithms/sg16/SG16Algorithm.java:76

↓ 2 callersMethodfloodFillMark

(int px, int py, int min, int max)

src/algorithms/sg16/ConvexHullSplitGenerator.java:940

↓ 2 callersMethodfreeze

Temporarily freeze the counter by storing the values.

src/main/utility/TimeCounter.java:57

↓ 2 callersMethodgcdRecurse

(int x, int y)

src/algorithms/anya/Fraction.java:163

↓ 2 callersMethodgenerate

(AnyaNode v)

src/algorithms/anya16/AnyaSearch.java:246

↓ 2 callersMethodgenerateAndSplitIntervals

Called by generateUpwards / Downwards. Note: Unlike Anya, 0-length intervals are possible.

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:1117

↓ 2 callersMethodgenerateAndSplitIntervals

Called by generateUpwards / Downwards. Note: Unlike Anya, 0-length intervals are possible.

src/algorithms/sparsevgs/LineOfSightScanner.java:1087

↓ 2 callersMethodgenerateConvexHullSnapshot

()

src/algorithms/sg16/SG16Algorithm.java:206

↓ 2 callersMethodgenerateProblem

(Random rand, ArrayList<ArrayList<Point>> connectedSets)

src/main/mazes/StoredTestMazes.java:322

↓ 2 callersMethodgenerateProblemInSet

(Random rand, ArrayList<Point> largestSet)

src/main/mazes/StoredTestMazes.java:350

↓ 2 callersMethodgenerateProblemsInLargestSet

(GridGraph gridGraph, int nProblems, int seed)

src/main/mazes/StoredTestMazes.java:276

↓ 2 callersMethodgenerateSameLevelObservable

Can be used for exploreLeftwards or exploreRightwards. This function will not split intervals.

src/algorithms/Anya.java:618

↓ 2 callersMethodgenerateSameLevelStart

Can be used for exploreLeftwards or exploreRightwards. This function will not split intervals.

src/algorithms/Anya.java:636

↓ 2 callersMethodgenerateSeededGraphOnlyDynamicCutoff

(long seed, int sizeX, int sizeY, float initialPercentBlocked, int iterations, float resolutionMultiplier, boo

src/main/graphgeneration/AutomataGenerator.java:35

↓ 2 callersMethodgenerateSeededGraphOnlyOld

For backwards compatibility. Removes the block at 0,0.

src/main/graphgeneration/DefaultGenerator.java:56

↓ 2 callersMethodgenerateSeededTrueRandomGraph

(long seed, int sizeX, int sizeY, int frequency, int sx, int sy, int ex, int ey)

src/main/graphgeneration/DefaultGenerator.java:74

↓ 2 callersMethodgenerateSeededTrueRandomGraphOnly

(long seed, int sizeX, int sizeY, int frequency)

src/main/graphgeneration/DefaultGenerator.java:78

↓ 2 callersMethodgenerateStartingStates

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:625

↓ 2 callersMethodgenerateStartingStates

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScanner.java:595

↓ 2 callersMethodgenerateTwoPointList

(int...points)

src/main/testgen/TestDataGenerator.java:128

↓ 2 callersMethodgetAlgo

(String algoName)

src/main/AlgoTest.java:102

↓ 2 callersMethodgetBenchmarkSet

(String setName)

src/uiandio/BenchmarkGraphSets.java:32

↓ 2 callersMethodgetCached

(SnapshotItem item)

src/algorithms/datatypes/SnapshotItem.java:35

↓ 2 callersMethodgetLargestComponentRatioToRemaining

(ArrayList<ArrayList<Point>> sets)

src/main/analysis/MazeAnalysis.java:116

↓ 2 callersMethodgetLargestComponentRatioToSecondLargest

(ArrayList<ArrayList<Point>> sets)

src/main/analysis/MazeAnalysis.java:96

↓ 2 callersMethodgetMaxSize

Compares the tile with the end point to set an upper bound on the size.

src/algorithms/AcceleratedAStar.java:203

↓ 2 callersFunctiongetMazeAttributes

(mazeName=None)

pyscripts/mazes.py:131

↓ 2 callersMethodgetNTrials

()

src/main/testgen/StandardMazes.java:100

↓ 2 callersMethodgetNext

()

src/algorithms/anya16/Path.java:29

↓ 2 callersMethodgetNextNodeIndex

(int p)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:265

↓ 2 callersMethodgetNextNodeIndex

(int p)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:233

↓ 2 callersMethodgetParentNode

()

src/algorithms/anya16/AnyaNode.java:84

↓ 2 callersMethodgetPath

()

src/algorithms/Anya.java:808

↓ 2 callersMethodgetPercentageBlocked

@return the percentage of blocked tiles as compared to the total grid size.

src/grid/GridGraph.java:391

↓ 2 callersMethodgetPrintAverageString

()

src/main/utility/TimeCounter.java:143

↓ 2 callersMethodgetRoot

()

src/algorithms/anya16/AnyaNode.java:100

↓ 2 callersMethodgetStoredGraph

(GridGraph graph)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:282

↓ 2 callersMethodgetValue

(V n)

src/algorithms/anya16/Heuristic.java:11

↓ 2 callersMethodgetVertex

()

src/algorithms/anya16/Path.java:31

↓ 2 callersMethodget_padded_width

()

src/algorithms/anya16/BitpackedGrid.java:641

↓ 2 callersMethodget_point_is_double_corner

(int x, int y)

src/algorithms/anya16/BitpackedGrid.java:122

↓ 2 callersMethodgoToFarLeft

()

src/algorithms/bst/BinaryTree.java:68

↓ 2 callersMethodgridAndGoals

(int problemIndex)

src/main/mazes/MazeAndTestCases.java:20

↓ 2 callersMethodhasNextLine

@return true iff there are more lines to read.

src/uiandio/GraphExporter.java:23

↓ 2 callersMethodhasTautExit

(int vFrom, int vTo, int currentLevel)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:447

↓ 2 callersMethodindexOf

(int px, int py)

src/main/graphgeneration/MazeMapGenerator.java:210

↓ 2 callersMethodindexOf

(int x, int y)

src/algorithms/visibilitygraph/VisibilityGraph.java:173

↓ 2 callersMethodindexOf

(int x, int y)

src/algorithms/sg16/SG16VisibilityGraph.java:101

↓ 2 callersMethodinitialise

(int size, float defaultKey)

src/algorithms/priorityqueue/ReusableIndirectHeap.java:45

↓ 2 callersMethodinitialiseExtents

(GridGraph graph)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:61

↓ 2 callersMethodinitialiseExtents

(GridGraph graph)

src/algorithms/sparsevgs/LineOfSightScanner.java:35

↓ 2 callersMethodintersectsEdge

(int px, int py, int edgeIndex)

src/algorithms/sg16/ConvexHullHeuristic.java:150

↓ 2 callersMethodisNode

(int x, int y)

src/algorithms/visibilitygraph/VisibilityGraph.java:177

↓ 2 callersMethodisNull

()

src/draw/GridObjects.java:31

↓ 2 callersMethodisSameAngle

(int sx, int sy, RPSScanner.Vertex u, RPSScanner.Vertex v)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:356

↓ 2 callersMethodisTaut

Checks whether the path v, u, p=parent(u) is taut.

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:230

↓ 2 callersMethodisTautSuccessor

(int sx, int sy, int nx, int ny)

src/algorithms/rotationalplanesweep/RPSScanner.java:452

↓ 2 callersMethodlineOfSight

@return true iff there is line-of-sight from (x1,y1) to (x2,y2).

src/grid/GridGraph.java:192

↓ 2 callersMethodlinkFromParent

(Node<E> current, Node<E> next, Stack<Node<E>> nodeStack)

src/algorithms/bst/AVLTree.java:358

↓ 2 callersMethodload

(String mapfile)

src/algorithms/anya16/BitpackedGrid.java:475

↓ 2 callersMethodloadAutomataDCMaze

(int sizeIndex, int resolutionIndex, int percentBlockedIndex)

src/main/mazes/StoredTestMazes.java:70

↓ 2 callersMethodloadBenchmark

(String mazeName)

src/uiandio/BenchmarkGraphImporter.java:118

↓ 2 callersMethodloadBenchmarkMaze

(String mazeName)

src/uiandio/BenchmarkGraphImporter.java:35

↓ 2 callersMethodloadBenchmarkMazeProblems

(String mazeName)

src/uiandio/BenchmarkGraphImporter.java:99

↓ 2 callersMethodloadTiledMaze

(int mazePoolIndex, int size)

src/main/mazes/StoredTestMazes.java:147

↓ 2 callersFunctionmakeCondition

(left=None, right=None, symbol=None)

pyscripts/mazes.py:307

↓ 2 callersMethodmakePrettyMazeFile

(GridGraph gridGraph, String filePath)

src/main/testgen/TestDataGenerator.java:239

↓ 2 callersMethodmakeProblemName

(int sx, int sy, int ex, int ey)

src/main/testgen/Stringifier.java:5

↓ 2 callersMethodmarkHasEdgeToGoal

(boolean value)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:185

↓ 2 callersMethodmarkHasEdgeToGoal

(boolean value)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:189

↓ 2 callersMethodmarkHasEdgeToGoal

(boolean value)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:834

↓ 2 callersMethodmaybeAddEdge

(int sx, int sy, RPSScanner.Vertex curr, RPSScanner.Edge edge)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:365

↓ 2 callersMethodmaybeDeleteEdge

(int sx, int sy, RPSScanner.Vertex curr, RPSScanner.Edge edge)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:392

↓ 2 callersMethodmaybeExpandArrays

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:176

↓ 2 callersMethodmergeMaps

(GridGraph[] gridGraphs, int nCols, int nRows)

src/main/graphgeneration/TiledMapGenerator.java:17

↓ 2 callersMethodmidX

()

src/algorithms/rotationalplanesweep/RPSScanner.java:152

← previous next →401–500 of 1,502, ranked by callers