This is the complete list of members for Graph, including all inherited members.
add_edge(const Vertex &v1, const Vertex &v2) | Graph | |
add_edge_property(const std::string &name, const T t=T()) | Graph | inline |
add_model_property(const std::string &name, const T t=T()) | Graph | inline |
add_vertex(const vec3 &p) | Graph | |
add_vertex_property(const std::string &name, const T t=T()) | Graph | inline |
assign(const Graph &rhs) | Graph | |
bounding_box(bool recompute=false) const | Model | |
clear() | Graph | |
collect_garbage() | Graph | |
delete_edge(Edge e) | Graph | |
delete_vertex(Vertex v) | Graph | |
edge_length(Edge e) const | Graph | |
edge_properties() const | Graph | inline |
edge_property(const std::string &name, const T t=T()) | Graph | inline |
edges() const | Graph | inline |
edges(Vertex v) const | Graph | inline |
edges_begin() const | Graph | inline |
edges_end() const | Graph | inline |
edges_size() const | Graph | inline |
empty() const | Model | inline |
find_edge(Vertex a, Vertex b) const | Graph | |
get_edge_property(const std::string &name) const | Graph | inline |
get_edge_property_type(const std::string &name) const | Graph | inline |
get_model_property(const std::string &name) const | Graph | inline |
get_model_property_type(const std::string &name) const | Graph | inline |
get_vertex_property(const std::string &name) const | Graph | inline |
get_vertex_property_type(const std::string &name) const | Graph | inline |
Graph() | Graph | |
Graph(const Graph &rhs) | Graph | inline |
has_garbage() const | Graph | inline |
invalidate_bounding_box() | Model | |
is_deleted(Vertex v) const | Graph | inline |
is_deleted(Edge e) const | Graph | inline |
is_isolated(Vertex v) const | Graph | inline |
is_valid(Vertex v) const | Graph | inline |
is_valid(Edge e) const | Graph | inline |
manipulator() | Model | inline |
manipulator() const | Model | inline |
Model(const std::string &name="unknown") | Model | explicit |
model_properties() const | Graph | inline |
model_property(const std::string &name, const T t=T()) | Graph | inline |
n_edges() const | Graph | inline |
n_vertices() const | Graph | inline |
name() const | Model | inline |
operator=(const Graph &rhs) | Graph | |
points() const override | Graph | inlinevirtual |
points() override | Graph | inlinevirtual |
position(Vertex v) const | Graph | inline |
position(Vertex v) | Graph | inline |
property_stats(std::ostream &output) const override | Graph | virtual |
remove_edge_property(EdgeProperty< T > &p) | Graph | inline |
remove_edge_property(const std::string &n) | Graph | inline |
remove_model_property(ModelProperty< T > &p) | Graph | inline |
remove_model_property(const std::string &n) | Graph | inline |
remove_vertex_property(VertexProperty< T > &p) | Graph | inline |
remove_vertex_property(const std::string &n) | Graph | inline |
rename_edge_property(const std::string &old_name, const std::string &new_name) | Graph | inline |
rename_model_property(const std::string &old_name, const std::string &new_name) | Graph | inline |
rename_vertex_property(const std::string &old_name, const std::string &new_name) | Graph | inline |
renderer() | Model | |
renderer() const | Model | |
reserve(unsigned int nvertices, unsigned int nedges) | Graph | |
resize(unsigned int nv, unsigned int ne) | Graph | inline |
set_manipulator(std::shared_ptr< Manipulator > manip) | Model | inline |
set_name(const std::string &n) | Model | inline |
set_renderer(std::shared_ptr< Renderer > r) | Model | inline |
source(Edge e) const | Graph | inline |
target(Edge e) const | Graph | inline |
valence(Vertex v) const | Graph | |
vertex(Edge e, unsigned int i) const | Graph | inline |
vertex_properties() const | Graph | inline |
vertex_property(const std::string &name, const T t=T()) | Graph | inline |
vertices() const | Graph | inline |
vertices(Vertex v) const | Graph | inline |
vertices_begin() const | Graph | inline |
vertices_end() const | Graph | inline |
vertices_size() const | Graph | inline |
~Graph() override=default | Graph | |
~Model() (defined in Model) | Model | virtual |