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

↓ 3 callersMethodbubbleDown

(int index)

src/algorithms/priorityqueue/IndirectHeap.java:148

↓ 3 callersMethodclearFloodFill

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:913

↓ 3 callersMethodclearMarkedEdges

(int current)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:930

↓ 3 callersMethodclearMemory

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:976

↓ 3 callersMethodclearNeighbours

()

src/algorithms/rotationalplanesweep/RPSScanner.java:198

↓ 3 callersMethodclearPath

()

src/draw/EditorUI.java:164

↓ 3 callersMethodcomputeOptimalPathLengthOnline

(GridGraph gridGraph, Point start, Point end)

src/main/utility/Utility.java:42

↓ 3 callersMethodcomputeStartEndPointData

(GridGraph gridGraph, Point p1, Point p2)

src/main/mazes/StoredTestMazes.java:307

↓ 3 callersMethodcontains_target

(double left, double right, int row)

src/algorithms/anya16/AnyaExpansionPolicy.java:353

↓ 3 callersMethodcreateObservableSuccessor

(Fraction xL, Fraction xR, int y, AnyaState sourceInterval)

src/algorithms/Anya.java:932

↓ 3 callersMethodcreateStartState

(Fraction xL, Fraction xR, int y, Point start)

src/algorithms/Anya.java:925

↓ 3 callersMethodcreateUnobservableSuccessor

(Fraction xL, Fraction xR, int y, Point basePoint, AnyaState sourceInterval)

src/algorithms/Anya.java:939

↓ 3 callersMethodexploreStates

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:692

↓ 3 callersMethodexploreStates

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScanner.java:662

↓ 3 callersFunctionfilterMazes

(mazeNames, conditions)

pyscripts/mazes.py:384

↓ 3 callersMethodflush

()

src/uiandio/FileIO.java:54

↓ 3 callersMethodgenerate

(boolean seededRandom, long seed, int sizeX, int sizeY, int unblockedRatio, int iterations, float resolutionMu

src/main/graphgeneration/AutomataGenerator.java:40

↓ 3 callersMethodgenerateDynamicCutoff

(boolean seededRandom, long seed, int sizeX, int sizeY, float initialPercentBlocked, int iterations, float res

src/main/graphgeneration/AutomataGenerator.java:57

↓ 3 callersMethodgenerateProblems

(GridGraph gridGraph, int nProblems, int seed)

src/main/mazes/StoredTestMazes.java:255

↓ 3 callersMethodgenerateSeeded

(long seed, int sizeX, int sizeY, int unblockedRatio, int iterations, float resolutionMultiplier, int cutoffOf

src/main/graphgeneration/AutomataGenerator.java:15

↓ 3 callersMethodgetKey

Obtain the key for this node. @return the key

src/algorithms/jgrapht/FibonacciHeapNode.java:91

↓ 3 callersMethodgetNumBlocked

@return the number of blocked tiles in the grid.

src/grid/GridGraph.java:398

↓ 3 callersMethodgetPath

@return retrieve the path computed by the algorithm

src/algorithms/PathFindingAlgorithm.java:87

↓ 3 callersMethodgetSize

()

src/algorithms/PathFindingAlgorithm.java:159

↓ 3 callersMethodhash

(AnyaNode n)

src/algorithms/anya16/AnyaExpansionPolicy.java:541

↓ 3 callersMethodheapify

Runtime: O(n)

src/algorithms/priorityqueue/IndirectHeap.java:83

↓ 3 callersMethodinit

(int width, int height)

src/algorithms/anya16/BitpackedGrid.java:82

↓ 3 callersMethodinit

(double left, double right, int row)

src/algorithms/anya16/AnyaInterval.java:27

↓ 3 callersMethodinitialise

(int s)

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:38

↓ 3 callersMethodinitialise

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

src/algorithms/sg16/SG16VisibilityGraph.java:50

↓ 3 callersMethodinitialise

(int size, float defaultDistance, int defaultParent, boolean defaultVisited)

src/algorithms/datatypes/Memory.java:55

↓ 3 callersMethodinitialiseScan

(int sx, int sy)

src/algorithms/rotationalplanesweep/RPSScanner.java:212

↓ 3 callersMethodinsert

Returns the handle to the value.

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:58

↓ 3 callersMethodisLessThan

(Edge e1, Edge e2, int sx, int sy)

src/algorithms/rotationalplanesweep/RPSScanner.java:81

↓ 3 callersMethodisOptimal

(double length, double optimalLength)

src/main/utility/Utility.java:136

↓ 3 callersMethodjumpD

(int x, int y)

src/algorithms/JumpPointSearch.java:182

↓ 3 callersMethodjumpL

(int x, int y)

src/algorithms/JumpPointSearch.java:148

↓ 3 callersMethodjumpR

(int x, int y)

src/algorithms/JumpPointSearch.java:165

↓ 3 callersMethodjumpU

(int x, int y)

src/algorithms/JumpPointSearch.java:199

↓ 3 callersMethodleftAnyExtent

(int xL, int y)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:1081

↓ 3 callersMethodleftAnyExtent

(int xL, int y)

src/algorithms/sparsevgs/LineOfSightScanner.java:1051

↓ 3 callersMethodlinesIntersect

(int sx, int sy, int tx, int ty, int ux, int uy, int vx, int vy)

src/algorithms/rotationalplanesweep/RPSScanner.java:578

↓ 3 callersMethodlinkedListRemove

(Node<E> current)

src/algorithms/bst/AVLTree.java:399

↓ 3 callersMethodloadMazeMaze

(int sizeIndex, int corridorWidthIndex, int connectednessIndex)

src/main/mazes/StoredTestMazes.java:167

↓ 3 callersMethodlog

(Node<E> node)

src/algorithms/bst/AVLTree.java:156

↓ 3 callersMethodlongToStr

(long i)

src/main/testgen/Stringifier.java:82

↓ 3 callersMethodmakeMazeFile

(GridGraph gridGraph, String filePath)

src/main/testgen/TestDataGenerator.java:230

↓ 3 callersMethodmakeProblemFiles

( ArrayList<ProblemAnalysis> problemList, String filePath)

src/main/testgen/TestDataGenerator.java:270

↓ 3 callersMethodoctileDistance

Octile distance: min(dx,dy) sqrt(2) + (max(dx,dy)-min(dx,dy)) = min(dx,dy) (sqrt(2)-1) + max(dx,dy)

src/grid/GridGraph.java:142

↓ 3 callersFunctionparseConditions

(args)

pyscripts/mazes.py:361

↓ 3 callersMethodprintAverageData

(int sampleSize, int nTrials)

src/main/AlgoTest.java:622

↓ 3 callersMethodprintMazeDetails

(String mazeName, GridGraph gridGraph)

src/main/AlgoTest.java:438

↓ 3 callersMethodproject_flat

(double ileft, double iright, int rootx, int rooty, BitpackedGrid grid)

src/algorithms/anya16/IntervalProjection.java:149

↓ 3 callersMethodreadProblem

(File file)

src/uiandio/GraphImporter.java:176

↓ 3 callersFunctionreaddata

(dataTypeStr, fileName)

pyscripts/testdataparser/parsetests.py:12

↓ 3 callersMethodreserve

Increases the capacity of the indirect heap, so that it can hold at least the number of elements specified by capacity without having to reallocate th

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:47

↓ 3 callersMethodrightAnyExtent

(int xR, int y)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:1093

↓ 3 callersMethodrightAnyExtent

(int xR, int y)

src/algorithms/sparsevgs/LineOfSightScanner.java:1063

↓ 3 callersMethodsearch

(AnyaNode start, AnyaNode target)

src/algorithms/anya16/AnyaSearch.java:114

↓ 3 callersMethodsetDistance

(int index, float value)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:577

↓ 3 callersMethodsetKey

(int index, float value)

src/algorithms/priorityqueue/ReusableIndirectHeap.java:75

↓ 3 callersMethodsetParent

(int index, int value)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:569

↓ 3 callersMethodswapEdge

(int e1, int e2)

src/main/graphgeneration/MazeMapGenerator.java:180

↓ 3 callersMethodswapSkipEdges

(int v, int i1, int i2)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:683

↓ 3 callersMethodtakeSnapShot

()

src/draw/KeyToggler.java:38

↓ 3 callersMethodtestAlgorithmPathLength

(GridGraph gridGraph, AlgoFunction algoFunction, TwoPoint tp)

src/main/AlgoTest.java:779

↓ 3 callersMethodtestAlgorithmSpeed

Tells the algorithm to compute a path. returns nothing. Used to test how long the algorithm takes to complete the computation.

src/main/AlgoTest.java:1004

↓ 3 callersMethodtestIndividualRunningTimes

(int sampleSize, int nTrials)

src/main/AlgoTest.java:666

↓ 3 callersMethodtestTautness

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

src/main/Experiment.java:608

↓ 3 callersMethodtoOneDimIndex

(int x, int y)

src/grid/GridGraph.java:56

↓ 3 callersMethodtoString

Returns a string representation of the node. @return A string representation of the data fields

src/algorithms/bst/Node.java:38

↓ 3 callersMethodtoString

()

src/algorithms/anya16/AnyaSearch.java:72

↓ 3 callersMethodtryRelaxVertex

(int u, int v, boolean addBuffer)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:167

↓ 3 callersMethodtryRetrieveFrozenValues

()

src/main/utility/TimeCounter.java:84

↓ 3 callersMethodunfreeze

Unfreeze the counter

src/main/utility/TimeCounter.java:77

↓ 3 callersMethodvisited

(int index)

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:277

↓ 2 callersMethodaddEdge

(int fromI, int toI, float weight)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:212

↓ 2 callersMethodaddEdge

(int fromI, int toI, float weight)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:216

↓ 2 callersMethodaddEdgesToVisibleNeighbours

(int index, int x, int y)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:170

↓ 2 callersMethodaddEdgesToVisibleNeighbours

(int index, int x, int y)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:174

↓ 2 callersMethodaddPairToQueue

(int parent, int parentOutgoingIndex)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:934

↓ 2 callersMethodaddStartAndEnd

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

src/algorithms/visibilitygraph/VisibilityGraph.java:122

↓ 2 callersMethodaddStartPoint

(int x, int y)

src/draw/EditorUI.java:86

↓ 2 callersMethodaddTempEdgesToVisibleNeighbours

(int index, int x, int y)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:770

↓ 2 callersMethodassignNodeAndConnect

(int x, int y)

src/algorithms/visibilitygraph/VisibilityGraph.java:74

↓ 2 callersMethodbubbleUp

(int i, int sx,int sy)

src/algorithms/rotationalplanesweep/RPSEdgeHeap.java:80

↓ 2 callersMethodbubbleUp

(int index)

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:81

↓ 2 callersMethodbubbleUp

(int index)

src/algorithms/priorityqueue/IndirectHeap.java:89

↓ 2 callersMethodcheckHasSqueezableCorners

(GridGraph gridGraph)

src/main/analysis/MazeAnalysis.java:66

↓ 2 callersMethodcheckIfContainsPointAndMaybeSplit

(int pointX, int pointY, SG16VisibilityGraph.ConvexHull hull)

src/algorithms/sg16/ConvexHullSplitGenerator.java:594

↓ 2 callersMethodcheckUpperBoundNew

<pre> _______ This function returns the upper bound detected by | |k=1| the a leftward and downward search. |___|___| k is

src/main/analysis/MazeAnalysis.java:265

↓ 2 callersMethodcheckUpperBoundNew

<pre> _______ This function returns the upper bound detected by | |k=1| the a leftward and downward search. |___|___| k is

src/algorithms/AcceleratedAStar.java:196

↓ 2 callersMethodclear

()

src/draw/GridPointSet.java:31

↓ 2 callersMethodcompose

(AffineTransform t1, AffineTransform t2)

src/main/graphgeneration/AffineTransform.java:67

↓ 2 callersMethodcomputeAllVisibleSuccessors

Stores results in successorsX, successorsY and nSuccessors.

src/algorithms/sparsevgs/LineOfSightScanner.java:145

↓ 2 callersMethodcomputeAllVisibleTwoWayTautSuccessors

Stores results in successorsX, successorsY and nSuccessors.

src/algorithms/sparsevgs/LineOfSightScanner.java:169

↓ 2 callersMethodcomputeAverageMaxSquare

(GridGraph gridGraph)

src/main/analysis/MazeAnalysis.java:172

↓ 2 callersMethodcomputeConnectedSetSizeList

()

src/main/analysis/MazeAnalysis.java:328

↓ 2 callersMethodcomputeDirectness

(double shortestPathLength, double straightLineDistance)

src/main/analysis/ProblemAnalysis.java:105

↓ 2 callersMethodcomputeDistanceCoverage

(double straightLineDistance, int sizeX, int sizeY)

src/main/analysis/ProblemAnalysis.java:99

← previous next →301–400 of 1,502, ranked by callers