graph_model.h
Go to the documentation of this file.
virtual void add_edge(const vertex_t &u, const vertex_t &v, const edge_t &a)=0
virtual int indeg(const vertex_t &v) const =0
virtual bool are_adj(const vertex_t &, const vertex_t &) const =0
Returs true if the two given vertices are adjacent, false otherwise.
Definition: bimap.h:17
virtual int outdeg(const vertex_t &v) const =0
virtual void add_vertex(const vertex_t &v)=0
virtual int num_edges() const =0
Definition: edge.h:19
virtual void remove_vertex(const vertex_t &v)=0
virtual int num_vertices() const =0
virtual void remove_edge(const vertex_t &u, const vertex_t &v)=0