Arc for graphs implemented with simple adjacency lists. More...

#include <tpl_sgraph.H>

Inheritance diagram for Aleph::Graph_Sarc< Arc_Info >:

Collaboration diagram for Aleph::Graph_Sarc< Arc_Info >:

Public Member Functions
	Graph_Sarc (const Arc_Info &info)

	Graph_Sarc (Arc_Info &&info=Arc_Info())

	Graph_Sarc (const Graph_Sarc &arc)

Graph_Sarc &	operator= (const Graph_Sarc &arc)

	Graph_Sarc (void src, void tgt, const Arc_Info &data)

	Graph_Sarc (void src, void tgt, Arc_Info &&data)

Public Member Functions inherited from GTArcCommon< ArcInfo >
	GTArcCommon () noexcept=default
	data contained in arc

	GTArcCommon (const ArcInfo &info)
	Construct from info value (copy)

	GTArcCommon (ArcInfo &&info)
	Construct from info value (move)

	GTArcCommon (void src, void tgt, const ArcInfo &data)
	Construct with endpoints and info (copy)

	GTArcCommon (void src, void tgt, ArcInfo &&data=ArcInfo())
	Construct with endpoints and info (move)

	GTArcCommon (const GTArcCommon &other)
	Copy constructor.

	GTArcCommon (GTArcCommon &&other) noexcept
	Move constructor.

GTArcCommon &	operator= (const GTArcCommon &other)
	Copy assignment operator.

GTArcCommon &	operator= (GTArcCommon &&other) noexcept
	Move assignment operator.

unsigned int	state () const noexcept
	Return the state of arc.

void	set_state (unsigned int s) noexcept
	Set the state of arc to value `s`

ArcInfo &	get_info () noexcept
	Return a modifiable reference to the arc data.

const ArcInfo &	get_info () const noexcept
	Return a constant reference to the arc data.

void *	get_connected_node (void *node) noexcept

void *	get_img_node (void *node) noexcept

Additional Inherited Members
Public Types inherited from GTArcCommon< ArcInfo >
using	Item_Type = ArcInfo

using	Arc_Type = ArcInfo

Public Attributes inherited from GTArcCommon< ArcInfo >
void *	src_node = nullptr

void *	tgt_node = nullptr
	Please don't use.

Graph_Attr	attrs
	Please don't use.

ArcInfo	arc_info

Detailed Description

template<typename Arc_Info = Empty_Class>
class Aleph::Graph_Sarc< Arc_Info >

Arc for graphs implemented with simple adjacency lists.

This class defines an arc or edge of a graph or digraph implemented using singly-linked adjacency lists.

There are basically three ways to define the information that belongs to a graph arc:

Through the type parameter inherent to the arc called Arc_Info.
Through inheritance from this base class. This is the way to maintain different arc types in a graph.
A combination of the above two.

Template Parameters

Arc_Info Data type stored in the arc and accessible via the get_info() method.

Note: This class is only intended for defining graph arcs. It is not intended to be used directly by users. It is preferable to use it through the methods provided by List_SGraph. While it is possible to use some methods or access some of its attributes, it is highly recommended not to use them directly. Instead, use the List_SGraph::Arc type and its associated methods.

A graph arc has three additional attributes present for each arc, named as follows:

Control bits (Bit_Fields): set of bits used by algorithms to mark the arc.
Counter (counter): counter generally used to mark a visit or processing order.
cookie: opaque pointer to any other temporary information to be associated with the arc.

Definition at line 196 of file tpl_sgraph.H.