Cdfc graph. More...

#include <cdfc_module_binding.hpp>

Inheritance diagram for CdfcGraph:

Collaboration diagram for CdfcGraph:

[legend]

Public Member Functions
	CdfcGraph (const CdfcGraphsCollectionRef cdfc_graphs_collection, const int selector)
	Constructor. More...

	CdfcGraph (const CdfcGraphsCollectionRef cdfc_graphs_collection, const int selector, const CustomUnorderedSet< vertex > &vertices)
	Constructor. More...

	~CdfcGraph () override
	Destructor. More...

const CdfcEdgeInfoConstRef	CGetCdfcEdgeInfo (const EdgeDescriptor e) const
	Returns the info associated with an edge. More...

void	WriteDot (const std::string &file_name, const int detail_level=0) const
	Writes this graph in dot format. More...

Public Member Functions inherited from graph
virtual	~graph ()=default
	Destructor. More...

bool	is_in_subset (const boost::graph_traits< graph >::vertex_descriptor v) const
	return true in case the vertex is a vertex of the subgraph. More...

int	GetSelector () const
	Return the selector of this graph. More...

int	GetSelector (const edge_descriptor e) const
	Return the selectors associated with an edge. More...

int	GetSelector (const boost::graph_traits< graphs_collection >::vertex_descriptor source, const boost::graph_traits< graphs_collection >::vertex_descriptor target) const
	Return the selectors associated with an edge. More...

void	GetStronglyConnectedComponents (std::map< size_t, UnorderedSetStdStable< boost::graph_traits< graphs_collection >::vertex_descriptor >> &strongly_connected_components) const
	Compute the strongly connected components of the graph. More...

void	BreadthFirstSearch (const boost::graph_traits< graphs_collection >::vertex_descriptor node, boost::bfs_visitor<> *vis) const
	Compute the breadth first search. More...

void	ReverseTopologicalSort (std::deque< boost::graph_traits< graphs_collection >::vertex_descriptor > &sorted_vertices) const
	Compute the reverse topological order of the graph. More...

void	TopologicalSort (std::list< boost::graph_traits< graphs_collection >::vertex_descriptor > &sorted_vertices) const
	Compute the topological order of the graph. More...

bool	IsReachable (const boost::graph_traits< graphs_collection >::vertex_descriptor x, const boost::graph_traits< graphs_collection >::vertex_descriptor y) const
	Compute if vertex y is reachable from x. More...

NodeInfoRef	GetNodeInfo (typename boost::graph_traits< graphs_collection >::vertex_descriptor node)
	FIXME: this method should become protected and called by equivalent method in subclasses Get the node property. More...

GraphInfoRef	GetGraphInfo ()
	FIXME: this method should become protected and called by equivalent method in subclasses Get the graph property. More...

const GraphInfoConstRef	CGetGraphInfo () const
	FIXME: this method should become protected and called by equivalent method in subclasses Get the graph property. More...

template<typename VertexWriterTemplate , typename EdgeWriterTemplate >
void	InternalWriteDot (const std::string &file_name, const VertexWriterConstRef vertex_writer, const EdgeWriterConstRef edge_writer) const
	Print the graph in dot format FIXME: this method should become protected and called by WriteDot. More...

bool	ExistsEdge (const boost::graph_traits< graphs_collection >::vertex_descriptor source, const boost::graph_traits< graphs_collection >::vertex_descriptor target) const
	Check if an edge exists. More...

boost::graph_traits< graphs_collection >::edge_descriptor	CGetEdge (const boost::graph_traits< graphs_collection >::vertex_descriptor source, const boost::graph_traits< graphs_collection >::vertex_descriptor target) const
	Returns the edge connecting two vertices; throw error if it does not exist. More...

	graph (graphs_collection *g, const int _selector)
	Standard constructor. More...

	graph (graphs_collection *g, const int _selector, const CustomUnorderedSet< boost::graph_traits< graphs_collection >::vertex_descriptor > &vertices)
	Sub-graph constructor. More...

Additional Inherited Members
Protected Member Functions inherited from graph
const NodeInfoConstRef	CGetNodeInfo (typename boost::graph_traits< graphs_collection >::vertex_descriptor node) const
	Get the node property. More...

EdgeInfoRef	GetEdgeInfo (typename boost::graph_traits< graphs_collection >::vertex_descriptor source, typename boost::graph_traits< graphs_collection >::vertex_descriptor target)
	Get the edge property. More...

const EdgeInfoConstRef	CGetEdgeInfo (typename boost::graph_traits< graphs_collection >::vertex_descriptor source, typename boost::graph_traits< graphs_collection >::vertex_descriptor target) const
	Get the edge property. More...

EdgeInfoRef	GetEdgeInfo (typename boost::graph_traits< graphs_collection >::edge_descriptor edge) const
	Get the edge property. More...

EdgeInfoConstRef	CGetEdgeInfo (typename boost::graph_traits< graphs_collection >::edge_descriptor edge) const
	Get the edge property. More...

template<typename VertexWriterTemplate , typename EdgeWriterTemplate , typename GraphWriterTemplate >
void	InternalWriteDot (const std::string &file_name, const VertexWriterConstRef vertex_writer, const EdgeWriterConstRef edge_writer, const GraphWriterConstRef graph_writer) const
	Print the graph in dot format. More...

Protected Attributes inherited from graph
graphs_collection *	collection
	The graph collection. More...

const int	selector
	selector More...

Detailed Description

Cdfc graph.

Definition at line 311 of file cdfc_module_binding.hpp.

Constructor & Destructor Documentation

◆ CdfcGraph() [1/2]

CdfcGraph::CdfcGraph	(	const CdfcGraphsCollectionRef	cdfc_graphs_collection,
		const int	selector
	)

Constructor.

Parameters

cdfc_graphs_collection	is the collections of graph to which this graph belongs
selector	is the selector which identifies the edges of this graph

Definition at line 764 of file cdfc_module_binding.cpp.

◆ CdfcGraph() [2/2]

CdfcGraph::CdfcGraph	(	const CdfcGraphsCollectionRef	cdfc_graphs_collection,
		const int	selector,
		const CustomUnorderedSet< vertex > &	vertices
	)

Constructor.

Parameters

cdfc_graphs_collection	is the collections of graph to which this graph belongs
selector	is the selector which identifies the edges of this graph
vertices	is the set of vertexes on which the graph is filtered.

Definition at line 769 of file cdfc_module_binding.cpp.

References ~CdfcGraph().

Here is the call graph for this function: