|
| ICovisibilityGraphManager ()=default |
| ICovisibilityGraphManager default constructor.
|
|
virtual | ~ICovisibilityGraphManager ()=default |
| ICovisibilityGraphManager default destructor.
|
|
virtual FrameworkReturnCode | increaseEdge (const uint32_t node1_id, const uint32_t node2_id, const float weight)=0 |
| This method allow to increase edge between 2 nodes. More...
|
|
virtual FrameworkReturnCode | decreaseEdge (const uint32_t node1_id, const uint32_t node2_id, const float weight)=0 |
| This method allow to decrease edge between 2 nodes. More...
|
|
virtual FrameworkReturnCode | removeEdge (const uint32_t node1_id, const uint32_t node2_id)=0 |
| This method allow to remove an edge between 2 nodes. More...
|
|
virtual FrameworkReturnCode | getEdge (uint32_t node1_id, uint32_t node2_id, float &weight) const =0 |
| This method allow to get edge between 2 nodes. More...
|
|
virtual bool | isEdge (const uint32_t node1_id, const uint32_t node2_id) const =0 |
| This method allow to verify that exist an edge between 2 nodes. More...
|
|
virtual FrameworkReturnCode | getAllNodes (std::set< uint32_t > &nodes_id) const =0 |
| This method allow to get all nodes of the graph. More...
|
|
virtual FrameworkReturnCode | suppressNode (const uint32_t node_id)=0 |
| This method allow to suppress a node of the graph. More...
|
|
virtual FrameworkReturnCode | getNeighbors (const uint32_t node_id, const float minWeight, std::vector< uint32_t > &neighbors, const uint32_t maxNbNeighbors=0) const =0 |
| This method allow to get neighbors of a node in the graph. More...
|
|
virtual FrameworkReturnCode | minimalSpanningTree (std::vector< std::tuple< uint32_t, uint32_t, float > > &edges_weights, float &minTotalWeights)=0 |
| This method allow to get minimal spanning tree of the graph. More...
|
|
virtual FrameworkReturnCode | maximalSpanningTree (std::vector< std::tuple< uint32_t, uint32_t, float > > &edges_weights, float &maxTotalWeights)=0 |
| This method allow to get maximal spanning tree of the graph. More...
|
|
virtual FrameworkReturnCode | getShortestPath (uint32_t node1_id, uint32_t node2_id, std::vector< uint32_t > &path)=0 |
| This method allow to get the shortest (by number of vertices) path between 2 nodes. More...
|
|
virtual FrameworkReturnCode | display () const =0 |
| This method allow to display all vertices and weighted edges of the covisibility graph.
|
|
virtual FrameworkReturnCode | saveToFile (const std::string &file) const =0 |
| This method allows to save the graph to the external file. More...
|
|
virtual FrameworkReturnCode | loadFromFile (const std::string &file)=0 |
| This method allows to load the graph from the external file. More...
|
|
virtual const SRef< SolAR::datastructure::CovisibilityGraph > & | getConstCovisibilityGraph () const =0 |
| This method returns the covisibility graph. More...
|
|
virtual std::unique_lock< std::mutex > | getCovisibilityGraph (SRef< SolAR::datastructure::CovisibilityGraph > &covisibilityGraph)=0 |
| This method returns the covisibility graph. More...
|
|
virtual void | setCovisibilityGraph (const SRef< SolAR::datastructure::CovisibilityGraph > covisibilityGraph)=0 |
| This method is to set the covisibility graph. More...
|
|
Allows to store the covisibility graph between keyframes. UUID: 15455f5a-0e99-49e5-a3fb-39de3eeb5b9b
This storage component can be accessed by processing components to share persistent data.