Link
Search
Menu
Expand
Document
PCG Extended Toolkit
∷ Installation
∷ General
Basics
PCGEx Nodes
Attribute Selectors
Working with Clusters
Comparisons
Blending
Filter Ecosystem
Uber Filter
Uber Filter (Collection)
🝖 Group (AND/OR)
🝖 Compare (Numeric)
🝖 Compare (String)
🝖 Bool
🝖 Within Range
🝖 Dot Product
🝖 Modulo Comparison
🝖 Bounds
🝖 Bitmask
🝖 Mean Value
🝖 Self Compare (Numeric)
🝖 Self Compare (String)
Clusters
Connect Points
🝆 Anisotropic
🝆 Index
🝆 Direction
🝆 Closest
Diagrams
Delaunay 2D
Voronoi 2D
Delaunay 3D
Voronoi 3D
Mesh to Clusters
Properties : Edge
Properties : Vtx
🝊 Special Neighbors
🝊 Special Edges
🝊 Edge Match
Refine
🝔 Minimum Spanning Tree
🝔 Remove by Collision
🝔 Remove Overlap
🝔 Keep by Filter
🝔 Keep Highest Score
🝔 Keep Lowest Score
🝔 Remove Highest Score
🝔 Remove by Filter
🝔 Remove Lowest Score
🝔 Keep Longest
🝔 Keep Shortest
🝔 Remove Longest
🝔 Remove Shortest
Flag Nodes
Node Flag
🝖 Adjacency
🝖 Edge Direction
🝖 Neighbors Count
Sanitize Clusters
Copy Cluster to Points
Pick Closest Cluster
Fuse Clusters
Relax
☍ Laplacian
☍ Force Directed
Find Clusters
Partition Vertices
Break to Paths
Make Unique
Connect Clusters
Packing Clusters
Pack Clusters
Unpack Clusters
Hulls
Convex Hull 3D
Convex Hull 2D
Draw Edges
Prune edges by Length
Pathfinding
Edges Pathfinding
Plot Edges Pathfinding
Find Contours
Navmesh Pathfinding
Plot Navmesh
⊚ Search
A* Star
Dijkstra
🝰 Heuristics
🝰 Heuristic Attribute
🝰 Shortest Distance
🝰 Azimuth
🝰 Feedback
🝰 Inertia
🝰 Steepness
🝰 Least Nodes
🝓 Goal Pickers
🝓 Goal from Attribute
🝓 Default
🝓 Random
Paths
Smooth
Moving Average
Radius
Path Spline Mesh
Solidify Path
Path × Path Crossings
Path × Bounds Intersections
Blend
Orient
⋋ Average
⋋ Look At
⋋ Weighted
Attribute Rolling
Fuse Collinear
Fuse Collinear
Offset
Subdivide
⋰ Interpolate
⋰ Inherit First
⋰ Inherit Last
Write Paths Properties
Write Tangents
∢ Auto Tangents
∢ Catmull-Rom
∢ From Transform
∢ Zero Tangents
Paths to Clusters
Staging
Asset Staging
Asset Collection to Set
Asset Collection
🝱 Actor Collection
🝱 Mesh Collection
Misc
Sort Points
🝘 Sort Rule
Sort Points (Static)
Partition by Values
🝗 Partition Rule
Partition by Values (Static)
Fuse Points
Points to Bounds
Reverse Points Order
Merge Points by Tags
Meta Filter
Conditional Actions
🝐 Write Result
🝐 Write Attributes
Cherry Pick Points
Meta Cleanup
Write Index
Refresh Seed
Bitmasks
Bitmask
Bitmask Merge
Discard Points by Count
Discard Points by Overlap
Transforms
Move Pivot
Bounds to Points
Flat Projection
Debug
Flush Debug
Draw Attributes
Lloyd Relax
2D Lloyd Relaxation
3D Lloyd Relaxation
Sampling
Sample Nearest Surface
Sample Line Trace
Sample Nearest Spline
Sample Nearest Points
Sample Overlap Stats
Sample Nearest Bounds
Sample Neighbors
All Nodes
About
Twitter
LinkedIn
Pathfinding
⊚ Search
Dijkstra
Dijkstra
Dijkstra’s Algorithm
The
Dijkstra’s Algorithm
search mode …
Table of content
Dijkstra on Wikipedia
DOC TDB
