graaf
Loading...
Searching...
No Matches
graaf::graph< VERTEX_T, EDGE_T, GRAPH_TYPE_V > Class Template Referenceexport
module graaf

Public Types

using vertex_t = VERTEX_T
using edge_t = EDGE_T
using vertices_t = std::unordered_set<vertex_id_t>
using vertex_id_to_vertex_t = std::unordered_map<vertex_id_t, VERTEX_T>
using edge_id_to_edge_t = std::unordered_map<edge_id_t, edge_t, edge_id_hash>

Public Member Functions

constexpr bool is_directed () const noexcept
constexpr bool is_undirected () const noexcept
std::size_t vertex_count () const noexcept
std::size_t edge_count () const noexcept
const vertex_id_to_vertex_t & get_vertices () const noexcept
const edge_id_to_edge_t & get_edges () const noexcept
bool has_vertex (vertex_id_t vertex_id) const noexcept
bool has_edge (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs) const noexcept
vertex_t & get_vertex (vertex_id_t vertex_id)
const vertex_t & get_vertex (vertex_id_t vertex_id) const
edge_t & get_edge (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs)
const edge_t & get_edge (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs) const
edge_t & get_edge (const edge_id_t &edge_id)
const edge_t & get_edge (const edge_id_t &edge_id) const
const vertices_t & get_neighbors (vertex_id_t vertex_id) const
vertex_id_t add_vertex (auto &&vertex)
vertex_id_t add_vertex (auto &&vertex, vertex_id_t id)
void remove_vertex (vertex_id_t vertex_id)
void add_edge (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs, auto &&edge)
void remove_edge (vertex_id_t vertex_id_lhs, vertex_id_t vertex_id_rhs)

The documentation for this class was generated from the following file:
  • /home/mccakit/desktop/graaf/src/graph_partition.cpp