Go to the documentation of this file.
8 #ifndef FIELDS2COVER_TYPES_GRAPH2D_H_
9 #define FIELDS2COVER_TYPES_GRAPH2D_H_
12 #include <unordered_map>
65 #endif // FIELDS2COVER_TYPES_GRAPH2D_H_
Graph2D & addEdge(const Point &i, const Point &j, int64_t cost)
Types used by fields2cover library.
int64_t shortestPathCost(const Point &from, const Point &to, int64_t INF=1<< 30)
std::vector< size_t > shortestPath(size_t from, size_t to, int64_t INF=1e15)
Point indexToNode(size_t id) const
Graph2D & removeDirectedEdge(const Point &from, const Point &to)
Graph2D & addDirectedEdge(const Point &from, const Point &to, int64_t cost)
Graph & addDirectedEdge(size_t from, size_t to, int64_t cost)
std::vector< Point > getNodes() const
std::vector< std::vector< size_t > > allPathsBetween(size_t from, size_t to) const
size_t nodeToIndex(const Point &p) const
std::unordered_map< size_t, Point > index_to_nodes_
std::vector< Point > shortestPath(const Point &from, const Point &to, int64_t INF=1<< 30)
Graph2D & removeEdge(const Point &i, const Point &j)
Graph & removeEdge(size_t i, size_t j)
std::unordered_map< Point, size_t > nodes_to_index_
Graph & addEdge(size_t i, size_t j, int64_t cost)
int64_t shortestPathCost(size_t from, size_t to, int64_t INF=1e15)
std::vector< std::vector< Point > > allPathsBetween(const Point &from, const Point &to) const
Graph & removeDirectedEdge(size_t from, size_t to)
fields2cover
Author(s):
autogenerated on Fri Apr 25 2025 02:18:31