Groups
Category
Level
Message passing treats meshes and point clouds as graphs where nodes exchange information with neighbors to learn useful features.
A graph models relationships between items using vertices (nodes) and edges (links).
Prim's algorithm builds a Minimum Spanning Tree (MST) by growing a tree from an arbitrary start vertex, always adding the lightest edge that connects the tree to a new vertex.
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.
Breadth-First Search (BFS) explores a graph level by level, visiting all vertices at distance d from the source before any at distance d+1.
Depth-First Search (DFS) explores a graph by going as deep as possible along each path before backtracking.