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

CodeHub MCPcopy Create free account

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

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

⨍ Functions 1,502◇ Types & classes 152

↓ 1 callersMethodcanGoUp

src/algorithms/BreadthFirstSearch.java:94

↓ 1 callersMethodcascadingCut

Performs a cascading cut operation. This cuts y from its parent and then does the same for its parent, and so on up the tree. <p>Running time: O(log

src/algorithms/jgrapht/FibonacciHeap.java:386

↓ 1 callersMethodcharToDigit

src/main/testgen/Stringifier.java:128

↓ 1 callersMethodcheckIntersectionAndMaybeSplit

(SG16VisibilityGraph.ConvexHull hull)

src/algorithms/sg16/ConvexHullSplitGenerator.java:574

↓ 1 callersMethodclearCached

src/algorithms/datatypes/SnapshotItem.java:29

↓ 1 callersMethodclearMemory

src/algorithms/Anya.java:893

↓ 1 callersMethodclearMemory

src/algorithms/visibilitygraph/VisibilityGraph.java:285

↓ 1 callersMethodclearMemory

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:303

↓ 1 callersMethodclearMemory

src/algorithms/sparsevgs/SparseVisibilityGraph.java:307

↓ 1 callersMethodclearMemory

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:285

↓ 1 callersMethodclearMemory

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:589

↓ 1 callersMethodclearMemory

src/algorithms/sparsevgs/LineOfSightScanner.java:1124

↓ 1 callersMethodclearMemory

src/algorithms/anya16/Anya16.java:144

↓ 1 callersMethodclearMemory

src/algorithms/priorityqueue/ReusableIndirectHeap.java:308

↓ 1 callersMethodclearMemory

src/algorithms/datatypes/Memory.java:134

↓ 1 callersMethodclearNeighbours

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:99

↓ 1 callersMethodclearToColor

src/draw/DrawCanvas.java:93

↓ 1 callersMethodcloseFile

pyscripts/mazes.py:29

↓ 1 callersMethodcomputeAllEdgeLevelsFast

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:325

↓ 1 callersMethodcomputeAllVisibleSuccessors

(int currX, int currY, int ex, int ey)

src/algorithms/sg16/SG16VisibilityGraph.java:92

↓ 1 callersMethodcomputeAllVisibleTautSuccessors

(int sx, int sy)

src/algorithms/rotationalplanesweep/RPSScanner.java:303

↓ 1 callersMethodcomputeExtents

src/algorithms/Anya.java:174

↓ 1 callersMethodcomputeExtents

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:146

↓ 1 callersMethodcomputeExtents

src/algorithms/sparsevgs/LineOfSightScanner.java:116

↓ 1 callersMethodcomputeIslandSize

(boolean[] visited, int sx, int sy, boolean acceptBorderIslands)

src/grid/BlockedIslandSearch.java:17

↓ 1 callersMethodcomputeMinHeadingChanges

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

src/main/analysis/ProblemAnalysis.java:110

↓ 1 callersMethodcomputeMinMax

MUST NOT SORT THE LENGTHS ARRAY.

src/main/testgen/TestDataLibrary.java:88

↓ 1 callersMethodcomputeNeighbours

(int currentIndex, int cx, int cy)

src/algorithms/JumpPointSearch.java:216

↓ 1 callersMethodcomputeOptimalPathLengthOffline

(GridGraph gridGraph, Point start, Point end)

src/main/utility/Utility.java:60

↓ 1 callersMethodcomputeOptimalPathOffline

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

src/main/utility/Utility.java:69

↓ 1 callersMethodcomputePath

src/algorithms/VisibilityGraphAlgorithm.java:55

↓ 1 callersMethodcomputePath

src/algorithms/visibilitygraph/BFSVisibilityGraph.java:26

↓ 1 callersMethodcomputePath

Call this to compute the path.

src/algorithms/anya16/Anya16.java:59

↓ 1 callersMethodcomputeReachable

(boolean[] visited, int sx, int sy)

src/grid/ReachableNodesFast.java:21

↓ 1 callersMethodcomputeSumDegrees

src/algorithms/visibilitygraph/VisibilityGraph.java:216

↓ 1 callersMethodcomputeSumDegrees

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:232

↓ 1 callersFunctioncondition

pyscripts/mazes.py:331

↓ 1 callersMethodcone_node_nobs

(AnyaNode node, ArrayList<AnyaNode> retval, IntervalProjection projection)

src/algorithms/anya16/AnyaExpansionPolicy.java:387

↓ 1 callersMethodcone_node_obs

(AnyaNode node, ArrayList<AnyaNode> retval, IntervalProjection projection)

src/algorithms/anya16/AnyaExpansionPolicy.java:361

↓ 1 callersMethodconnectSkipEdgesAndGroupLevelWEdges

Connects the previously marked skip vertices to form a graph of skip-edges.

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:538

↓ 1 callersMethodconsolidate

src/algorithms/jgrapht/FibonacciHeap.java:407

↓ 1 callersMethodconstructGraph

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:105

↓ 1 callersFunctioncorrelate

pyscripts/mazes.py:273

↓ 1 callersFunctioncountPrefixMatch

pyscripts/mazes.py:72

↓ 1 callersMethodcreate

(boolean[][] result)

src/uiandio/GraphImporter.java:63

↓ 1 callersMethodcreateRpsScannerFromGrid

(GridGraph graph)

src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:18

↓ 1 callersMethodcsv

(String filename)

src/uiandio/FileIO.java:29

↓ 1 callersMethodcurrentLineToString

src/uiandio/GraphExporter.java:42

↓ 1 callersMethodcurrentTicket

src/algorithms/datatypes/Memory.java:78

↓ 1 callersMethoddefaultToStringReadable

(int seed, int sizeX, int sizeY, int unblockedRatio)

src/main/testgen/Stringifier.java:53

↓ 1 callersMethoddepthLimit

(GridGraph graph, int sx, int sy, int ex, int ey, int depthLimit)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:52

↓ 1 callersMethoddequeue

src/grid/BlockedIslandSearch.java:86

↓ 1 callersMethoddequeue

src/grid/ReachableNodesFast.java:98

↓ 1 callersMethoddetectMaxSquare

<pre> returns the size of the max square at (x,y). can possibly return 0. Method copied from AcceleratedAStar. 1: XX XX 2: XXX XXX XXX </pre

src/main/analysis/MazeAnalysis.java:228

↓ 1 callersMethoddetectMaxSquare

<pre> returns the size of the max square at (x,y). can possibly return 0. 1: XX XX 2: XXX XXX XXX </pre>

src/algorithms/AcceleratedAStar.java:149

↓ 1 callersMethoddisplayAlgorithmOperation

Records the algorithm, the final path computed, and displays a trace of the algorithm.<br> Note: the algorithm used is the one specified in the algoFu

src/main/Visualisation.java:50

↓ 1 callersMethoddouble_x

(double x, double y)

src/main/graphgeneration/AffineTransform.java:103

↓ 1 callersMethoddouble_y

(double x, double y)

src/main/graphgeneration/AffineTransform.java:107

↓ 1 callersMethoddrawFractionLine

(Graphics g, FractionLine line)

src/draw/GridLineDrawer.java:51

↓ 1 callersMethoddrawPoint

(Graphics g, GridPointSet.ColourPoint point)

src/draw/GridPointDrawer.java:57

↓ 1 callersMethoddrawSquare

(Graphics g, int x, int y)

src/draw/GridGraphDrawer.java:30

↓ 1 callersMethodexpand

src/algorithms/anya16/ExpansionPolicy.java:22

↓ 1 callersMethodexploreFromSameLevel

(AnyaState currState, Point basePoint)

src/algorithms/Anya.java:216

↓ 1 callersMethodexploreStatesNonTaut

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:898

↓ 1 callersMethodexploreStatesNonTaut

(int sx, int sy)

src/algorithms/sparsevgs/LineOfSightScanner.java:868

↓ 1 callersMethodexplorefromAbove

(AnyaState currState, Point basePoint)

src/algorithms/Anya.java:438

↓ 1 callersMethodexplorefromBelow

(AnyaState currState, Point basePoint)

src/algorithms/Anya.java:289

↓ 1 callersMethodexport

src/main/testgen/TestDataGenerator.java:35

↓ 1 callersMethodfillCorners

Post-processing step to remove situations like this: <pre> ___ ___ | ||||| |...X'''| |||||___|</pre> An unblocked path can pass through x from

src/main/graphgeneration/DefaultGenerator.java:132

↓ 1 callersFunctionfindClosestMatch

pyscripts/mazes.py:82

↓ 1 callersMethodfindMinDistance

src/algorithms/VisibilityGraphAlgorithm.java:113

↓ 1 callersMethodfindPath1Parent

(int current, int x, int y)

src/algorithms/LazyThetaStar.java:62

↓ 1 callersFunctionfindProperties

pyscripts/mazes.py:395

↓ 1 callersMethodfindSmallestChildAndPush

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

src/algorithms/bst/AVLTree.java:388

↓ 1 callersMethodfindSuitableSeed

(float percentBlocked, float resolution, int iterations, boolean bordersAreBlocked, int size)

src/main/Experiment.java:720

↓ 1 callersMethodflat_node_nobs

(AnyaNode node, ArrayList<AnyaNode> retval, IntervalProjection projection)

src/algorithms/anya16/AnyaExpansionPolicy.java:519

↓ 1 callersMethodflat_node_obs

(AnyaNode node, ArrayList<AnyaNode> retval, IntervalProjection projection)

src/algorithms/anya16/AnyaExpansionPolicy.java:483

↓ 1 callersMethodfloatToOneDigitStandardFormStr

src/main/testgen/Stringifier.java:91

↓ 1 callersMethodfloodFillMarkEqual

src/algorithms/sg16/ConvexHullSplitGenerator.java:928

↓ 1 callersMethodgcd

src/algorithms/RecursiveThetaStar.java:52

↓ 1 callersMethodgenerate

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

src/algorithms/sg16/ConvexHullSplitGenerator.java:990

↓ 1 callersMethodgenerateConnectedComponentIndexes

(ArrayList<ArrayList<Point>> connectedSets)

src/draw/EditorUI.java:67

↓ 1 callersMethodgenerateConvexHull

(int px, int py)

src/algorithms/sg16/ConvexHullSplitGenerator.java:380

↓ 1 callersMethodgenerateConvexHulls

src/algorithms/sg16/ConvexHullSplitGenerator.java:348

↓ 1 callersMethodgenerateDownwardsObservable

(Fraction leftBound, Fraction rightBound, AnyaState source)

src/algorithms/Anya.java:673

↓ 1 callersMethodgenerateDownwardsStart

(Fraction leftBound, Fraction rightBound, Point start)

src/algorithms/Anya.java:681

↓ 1 callersMethodgenerateGraph

src/main/testgen/StandardMazes.java:104

↓ 1 callersMethodgenerateIncrementalTautStartingStates

Assumption: We are at an outer corner. One of six cases: BR BL TR TL TRBL TLBR XXX| |XXX : :

src/algorithms/sparsevgs/LineOfSightScannerDouble.java:236

↓ 1 callersMethodgenerateIncrementalTautStartingStates

Assumption: We are at an outer corner. One of six cases: BR BL TR TL TRBL TLBR XXX| |XXX : :

src/algorithms/sparsevgs/LineOfSightScanner.java:206

↓ 1 callersMethodgenerateProblem

(Random rand, MazeAnalysis mazeAnalysis)

src/main/analysis/MazeAnalyser.java:87

↓ 1 callersMethodgenerateProblems

(MazeAnalysis mazeAnalysis, int nProblems)

src/main/analysis/MazeAnalyser.java:66

↓ 1 callersMethodgenerateProblemsInLargestSetOffline

(GridGraph gridGraph, int nProblems, int seed)

src/main/mazes/StoredTestMazes.java:280

↓ 1 callersMethodgenerateRandomBlockMap

Generates a random "block" map for the gridGraph.<br> This generates more realistic grids by spawning clusters of blocks instead of simply spawning ra

src/main/graphgeneration/DefaultGenerator.java:169

↓ 1 callersMethodgenerateRandomMap

Generates a truly random map for the gridGraph. No longer used as this does not generate very good or realistic grids.

src/main/graphgeneration/DefaultGenerator.java:114

↓ 1 callersMethodgenerateRandomMap

(Random rand, GridGraph gridGraph, int frequency, int iterations, float resolutionMultiplier, int cutoffOffset

src/main/graphgeneration/AutomataGenerator.java:75

↓ 1 callersMethodgenerateRandomMap

src/main/graphgeneration/MazeMapGenerator.java:130

↓ 1 callersMethodgenerateRandomMapDynamicCutoff

(Random rand, GridGraph gridGraph, float percentBlocked, int iterations, float resolutionMultiplier, boolean b

src/main/graphgeneration/AutomataGenerator.java:114

↓ 1 callersMethodgenerateSeeded

(long seed, int sizeX, int sizeY, int corridorWidth, float connectednessRatio, int sx, int sy, int

src/main/graphgeneration/MazeMapGenerator.java:28

↓ 1 callersMethodgenerateSeededDynamicCutoff

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

src/main/graphgeneration/AutomataGenerator.java:30

↓ 1 callersMethodgenerateSeededGraphOnly

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

src/main/graphgeneration/AutomataGenerator.java:20

← previous next →601–700 of 1,502, ranked by callers