MinimumSpanningTree.hpp File Reference

#include <vector>
#include <unordered_map>
#include <unordered_set>
#include "Point.hpp"

Include dependency graph for MinimumSpanningTree.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Slic3r::MinimumSpanningTree
	Implements Prim's algorithm to compute Minimum Spanning Trees (MST). More...
struct	Slic3r::MinimumSpanningTree::Edge
	Represents an edge of the tree. More...

Namespaces
namespace	Slic3r
	|/ Copyright (c) Prusa Research 2020 - 2023 Enrico Turri @enricoturri1966 |/ |/ PrusaSlicer is released under the terms of the AGPLv3 or higher |/

---

Class Documentation

Slic3r::MinimumSpanningTree::Edge

struct Slic3r::MinimumSpanningTree::Edge

Represents an edge of the tree.

While edges are meant to be undirected, these do have a start and end point.

Collaboration diagram for Slic3r::MinimumSpanningTree::Edge:

Class Members
const Point	end	The point at which this edge ends.
const Point	start	The point at which this edge starts.