graphdom::non_mixed_graph< VertexType > Class Template Reference

Every non-mixed graph created using this library is an instance of a concrete class publicly derived, directly or indirectly, from this polymorphic template class. More...

#include <non_mixed_graph.h>

Inheritance diagram for graphdom::non_mixed_graph< VertexType >:

Collaboration diagram for graphdom::non_mixed_graph< VertexType >:

Public Member Functions
	~non_mixed_graph () override=default
	To be polymorphic, this class has a virtual destructor.
virtual void	insert_edge (const typename graph< VertexType >::vertex_const_handle &first_endpoint, const typename graph< VertexType >::vertex_const_handle &second_endpoint)=0
Public Member Functions inherited from graphdom::graph< VertexType >
virtual	~graph ()=default
	To be polymorphic, this class has a virtual destructor.
virtual std::size_t	order () const =0
	Returns the order of *this, i.e. the number of vertices inside the graph.
virtual void	erase_vertex (const vertex_const_handle &vertex)=0
	Removes the vertex identified by vertex.
virtual adj_list_iterator	erase_edge (const adj_list_const_iterator &)=0

Detailed Description

template<typename VertexType>
class graphdom::non_mixed_graph< VertexType >

Every non-mixed graph created using this library is an instance of a concrete class publicly derived, directly or indirectly, from this polymorphic template class.

Creating an object of a user-defined class derived, directly or indirectly, from this one will cause undefined behavior.

Member Function Documentation

insert_edge()

template<typename VertexType>

virtual void graphdom::non_mixed_graph< VertexType >::insert_edge ( const typename graph< VertexType >::vertex_const_handle & first_endpoint, const typename graph< VertexType >::vertex_const_handle & second_endpoint )

pure virtual

If *this is an ugraph then inserts in *this an undirected edge having first_endpoint and second_endpoint as endpoints, if *this doesn't already contain the same edge.
If *this is a digraph then inserts in *this a directed edge having first_endpoint as tail and second_endpoint as head, if *this doesn't already contain the same edge.

Parameters

first_endpoint	This handle must be valid and must identify a vertex belonging to *this, otherwise the insertion will cause undefined behavior.
second_endpoint	This handle must be valid and must identify a vertex belonging to *this, otherwise the insertion will cause undefined behavior.

Implemented in graphdom::labeled_edge_non_mixed_graph< VertexType, EdgeLabelType, EdgeLabellerType >, and graphdom::labeled_edge_non_mixed_graph< VertexType, EdgeLabelType, default_edge_labeller< VertexType, EdgeLabelType > >.

---

The documentation for this class was generated from the following file:

• include/graphdom/non_mixed_graph.h