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

↓ 1 callersMethodlineOfSight

(int node1, int node2)

src/algorithms/AStarStaticMemory.java:147

↓ 1 callersMethodlineOfSightIgnoringMarked

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

src/algorithms/sg16/ConvexHullSplitGenerator.java:715

↓ 1 callersMethodlinesIntersect

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

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:452

↓ 1 callersMethodlinesIntersect

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

src/algorithms/sg16/ConvexHullHeuristic.java:154

↓ 1 callersMethodlink

Make node y a child of node x. <p>Running time: O(1) actual</p> @param y node to become child @param x node to become parent

src/algorithms/jgrapht/FibonacciHeap.java:556

↓ 1 callersFunctionlistData

(args)

pyscripts/mazes.py:242

↓ 1 callersFunctionlistMazes

()

pyscripts/mazes.py:64

↓ 1 callersMethodloadAutomataMaze

(int sizeIndex, int resolutionIndex)

src/main/mazes/StoredTestMazes.java:24

↓ 1 callersMethodloadDefault

(String mazeName)

src/main/GridGraphVisualiser.java:59

↓ 1 callersMethodloadDefault

()

src/main/TextOutputVisualisation.java:33

↓ 1 callersMethodloadStoredMazeProblemData

(String mazeName)

src/uiandio/GraphImporter.java:161

↓ 1 callersMethodloadStoredMazeProblems

(String mazeName)

src/uiandio/GraphImporter.java:148

↓ 1 callersFunctionmain

()

pyscripts/testdataparser/parsetests.py:5

↓ 1 callersMethodmakeHull

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:207

↓ 1 callersMethodmakeProblemFileName

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

src/main/testgen/TestDataGenerator.java:292

↓ 1 callersMethodmarkInteriorAsDone

(SG16VisibilityGraph.ConvexHull hull, int px, int py)

src/algorithms/sg16/ConvexHullSplitGenerator.java:779

↓ 1 callersMethodmarkObstacle

(int px, int py, int index)

src/algorithms/sg16/ConvexHullSplitGenerator.java:309

↓ 1 callersMethodmarkSkipVertices

For each skip vertex, we initialise outgoingSkipEdgeNextNodes and nSkipEdges for all skip vertices. Thus, we have: nSkipEdgess[v] == 0 iff v is not a

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:499

↓ 1 callersMethodmaybePostSmooth

()

src/algorithms/AStarStaticMemory.java:169

↓ 1 callersMethodmaybeSaveSearchSnapshotWithSuccessors

(ConvexHullRPSScanner scanner, int currX, int currY)

src/algorithms/sg16/SG16Algorithm.java:264

↓ 1 callersMethodmaybeSaveSnapshot

()

src/algorithms/visibilitygraph/VisibilityGraph.java:247

↓ 1 callersMethodmazeMapToString

(long seed, int sizeX, int sizeY, int corridorWidth, float connectednessRatio)

src/main/testgen/Stringifier.java:43

↓ 1 callersFunctionmeetsConditions

(attrs, conditions)

pyscripts/mazes.py:373

↓ 1 callersMethodmergeMapsDefault

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

src/main/graphgeneration/TiledMapGenerator.java:12

↓ 1 callersMethodmergeSets

(int v1, int v2)

src/main/graphgeneration/MazeMapGenerator.java:186

↓ 1 callersMethodminCircleSize

()

src/draw/GridPointSet.java:43

↓ 1 callersMethodnameToMapFile

(String name)

src/uiandio/BenchmarkGraphImporter.java:17

↓ 1 callersMethodnameToScenFile

(String name)

src/uiandio/BenchmarkGraphImporter.java:21

↓ 1 callersMethodnotExists

(List<AnyaNode> nodeList, AnyaNode node)

src/algorithms/anya16/AnyaNode.java:120

↓ 1 callersMethodnullObject

()

src/draw/GridObjects.java:27

↓ 1 callersMethodonLineToGoal

(int sx, int sy, int ex, int ey, int ux, int uy, int vx, int vy)

src/algorithms/rotationalplanesweep/ConvexHullRPSScanner.java:519

↓ 1 callersMethodoptions

(GridGraph gridGraph, String... options)

src/main/analysis/MazeAnalysis.java:62

↓ 1 callersFunctionparseAttrs

(attrs, left, right)

pyscripts/mazes.py:290

↓ 1 callersFunctionparseCondition

(s)

pyscripts/mazes.py:343

↓ 1 callersFunctionparseData

(line)

pyscripts/testdataparser/parsetests.py:13

↓ 1 callersFunctionparseName

(line)

pyscripts/testdataparser/parsetests.py:59

↓ 1 callersMethodpathLength

()

src/algorithms/VisibilityGraphAlgorithm.java:169

↓ 1 callersMethodpathLength

()

src/algorithms/AStarStaticMemory.java:137

↓ 1 callersMethodpathLength

()

src/algorithms/Anya.java:798

↓ 1 callersMethodpathLength

()

src/algorithms/AStar.java:141

↓ 1 callersMethodpathLength

()

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithmFibHeap.java:157

↓ 1 callersMethodpathLength

()

src/algorithms/sparsevgs/SparseVisibilityGraphAlgorithm.java:127

↓ 1 callersMethodpathLength

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:307

↓ 1 callersMethodpathLength

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:275

↓ 1 callersMethodpathLength

()

src/algorithms/sparsevgs/VisibilityGraphAlgorithmOptimised.java:128

↓ 1 callersMethodpathLength

()

src/algorithms/sg16/SG16Algorithm.java:136

↓ 1 callersMethodpeekSecondLast

(ArrayDeque<GridObjects> list)

src/draw/KeyToggler.java:67

↓ 1 callersMethodpointsEqual

(Point2D.Double p1, Point2D.Double p2)

src/algorithms/anya16/AnyaSearch.java:110

↓ 1 callersMethodpopFirst

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:152

↓ 1 callersMethodpopLast

()

src/algorithms/sg16/ConvexHullSplitGenerator.java:158

↓ 1 callersMethodpostProcess

()

src/algorithms/rotationalplanesweep/GridPolygonGenerator.java:311

↓ 1 callersMethodpqDijkstra

()

src/algorithms/VisibilityGraphAlgorithm.java:125

↓ 1 callersMethodpreOrderTraverse

Perform a preorder traversal. @param node The local root @param depth The depth @param sb The string buffer to save the output

src/algorithms/bst/BinaryTree.java:198

↓ 1 callersFunctionprettyPrint

(attrs)

pyscripts/mazes.py:152

↓ 1 callersFunctionprintCorrelation

(vector1, vector2)

pyscripts/mazes.py:192

↓ 1 callersMethodprintHelp

()

src/draw/VisualiserKeyboardControls.java:80

↓ 1 callersMethodprintStatistics

An optimal overridable method which prints some statistics when called for.

src/algorithms/PathFindingAlgorithm.java:98

↓ 1 callersMethodprint_path

(SearchNode current, java.io.PrintStream stream)

src/algorithms/anya16/AnyaSearch.java:99

↓ 1 callersMethodprocessNode

(int current, int destination, int destX, int destY)

src/algorithms/AcceleratedAStar.java:121

↓ 1 callersMethodproject_f2c

(AnyaNode node, BitpackedGrid grid)

src/algorithms/anya16/IntervalProjection.java:178

↓ 1 callersMethodpruneParallelSkipEdges

OPTIMISATION: Parallel Skip-Edge Reduction Idea: Fix two vertices u and v. Suppose there exists two parallel skip edges e1, e2, between u and v. Let

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:599

↓ 1 callersMethodreadFile

(File file)

src/uiandio/GraphImporter.java:195

↓ 1 callersMethodrealTimePathfindUpdate

(int x, int y)

src/draw/EditorUI.java:260

↓ 1 callersMethodrecordAlgorithmOperation

Records a trace of the current algorithm into a LinkedList of GridObjects.

src/main/Visualisation.java:89

↓ 1 callersMethodrelax

(int u, int v, float weightUV)

src/algorithms/AStarStaticMemory.java:117

↓ 1 callersMethodrelax

(int u, int v, float weightUV)

src/algorithms/BasicThetaStar.java:43

↓ 1 callersMethodrelax

(int u, int v, float weightUV)

src/algorithms/strictthetastar/RecursiveStrictThetaStar.java:144

↓ 1 callersMethodrelax

(int u, int v, float weightUV)

src/algorithms/strictthetastar/StrictThetaStar.java:124

↓ 1 callersMethodrelaxExisting

(AnyaState source, AnyaState successorCopy, int existingHandle)

src/algorithms/Anya.java:154

↓ 1 callersMethodrelaxSuccessors

(int current, int x, int y, int squareSize)

src/algorithms/AcceleratedAStar.java:92

↓ 1 callersMethodrelaxSuccessorsSizeZero

(int current, int x, int y)

src/algorithms/AcceleratedAStar.java:64

↓ 1 callersMethodrelaxViaSkipEdge

Skip Edge Parents .--'''''-. _ n .' (_) _/ '-._ (_) (_) v u We use a ha

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:226

↓ 1 callersMethodrelaxViaSkipEdge

Skip Edge Parents .--'''''-. _ n .' (_) _/ '-._ (_) (_) v u We use a ha

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:194

↓ 1 callersMethodremoveStartAndEnd

Assumption: start and end are the last two nodes, if they exist.

src/algorithms/visibilitygraph/VisibilityGraph.java:94

↓ 1 callersMethodrepurpose

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

src/algorithms/visibilitygraph/VisibilityGraph.java:254

↓ 1 callersMethodrepurpose

(VisibilityGraphOptimised oldGraph)

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:257

↓ 1 callersMethodrepurpose

(SparseVisibilityGraph oldGraph)

src/algorithms/sparsevgs/SparseVisibilityGraph.java:261

↓ 1 callersMethodreset

()

src/algorithms/jgrapht/FibonacciHeapNode.java:72

↓ 1 callersMethodresolveFinalPath

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:269

↓ 1 callersMethodresolveFinalPath

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:237

↓ 1 callersMethodresolveSkipEdgeNextNode

(int v)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithmFibHeap.java:249

↓ 1 callersMethodresolveSkipEdgeNextNode

(int v)

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraphAlgorithm.java:217

↓ 1 callersMethodrestoreOriginalGraph

()

src/algorithms/sparsevgs/VisibilityGraphOptimised.java:87

↓ 1 callersMethodrestoreOriginalGraph

()

src/algorithms/sparsevgs/SparseVisibilityGraph.java:91

↓ 1 callersMethodrestoreOriginalGraph

()

src/algorithms/sparsevgs/EdgeNLevelSparseVisibilityGraph.java:716

↓ 1 callersMethodretrieve

()

src/uiandio/GraphImporter.java:83

↓ 1 callersFunctionretrieveFloatVectors

(var1, var2, conditionArgs)

pyscripts/mazes.py:205

↓ 1 callersMethodretrieveSnapshotList

@return retrieve the trace of the algorithm that has been recorded.

src/algorithms/PathFindingAlgorithm.java:75

↓ 1 callersMethodrightCenterRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:54

↓ 1 callersMethodrightChild

(int index)

src/algorithms/priorityqueue/FastVariableSizeIndirectHeap.java:243

↓ 1 callersMethodrightChild

(int index)

src/algorithms/priorityqueue/IndirectHeap.java:283

↓ 1 callersMethodrightLeftRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:108

↓ 1 callersMethodrightRightRotate

(AVLNode<E> root)

src/algorithms/bst/AVLTree.java:21

↓ 1 callersMethodrotate

(double angle)

src/main/graphgeneration/AffineTransform.java:38

↓ 1 callersMethodrotateLeft

(boolean stopAtEnd)

src/draw/KeyToggler.java:56

↓ 1 callersMethodrotateRight

(boolean stopAtEnd)

src/draw/KeyToggler.java:83

↓ 1 callersMethodrun

()

src/main/Visualisation.java:27

↓ 1 callersMethodrun

()

src/main/GridGraphVisualiser.java:23

↓ 1 callersMethodrun

()

src/main/AlgoTest.java:58

↓ 1 callersMethodrun

()

src/main/TextOutputVisualisation.java:20

← previous next →801–900 of 1,502, ranked by callers