Class implementing a non-multiedges graph.A non-multiedges graph does not allow multiple edges between the same source and target vertices.
More...
|
| NMG (size_t sz) |
| Create a non-multiedges graph with the specified number of vertices.
|
|
edge_descriptor | add_edge (edge_descriptor const &ed) |
| Adds the specified edge to the graph, if it doesn't already exist. More...
|
|
edge_descriptor | add_edge (edge_descriptor const &ed, edge_property const &p) |
| Adds the specified edge to the graph, if it doesn't already exist, with the given property. More...
|
|
|
typedef base_type::edge_descriptor | edge_descriptor |
|
typedef base_type::edge_property | edge_property |
|
template<class Traits>
class stapl::sequential::NMG< Traits >
Class implementing a non-multiedges graph.
A non-multiedges graph does not allow multiple edges between the same source and target vertices.
- Template Parameters
-
Traits | A traits class that defines customizable components of graph, such as the descriptor, model, storage, etc. |
◆ add_edge() [1/2]
Adds the specified edge to the graph, if it doesn't already exist.
- Parameters
-
ed | The descriptor of the edge to be added. |
- Returns
- The edge descriptor of the added edge. If successful, the id() of the descriptor is populated with the actual edge's id, otherwise set to std::numeric_limits<size_t>::max().
◆ add_edge() [2/2]
template<class Traits >
edge_descriptor stapl::sequential::NMG< Traits >::add_edge |
( |
edge_descriptor const & |
ed, |
|
|
edge_property const & |
p |
|
) |
| |
Adds the specified edge to the graph, if it doesn't already exist, with the given property.
- Parameters
-
ed | The descriptor of the edge to be added. |
- Returns
- The edge descriptor of the added edge. If successful, the id() of the descriptor is populated with the actual edge's id, otherwise set to std::numeric_limits<size_t>::max().
The documentation for this class was generated from the following file: