dg::DGraph< NodeT, EdgeT, IDT > Member List

This is the complete list of members for dg::DGraph< NodeT, EdgeT, IDT >, including all inherited members.

_CN typedef	dg::DGraph< NodeT, EdgeT, IDT >	protected
_ET typedef	dg::DGraphBase< void, std::string >	protected
clear()	dg::DGraphBase< void, std::string >	inline
clearEdges()	dg::DGraphBase< void, std::string >	inline
DGraphBase()=default	dg::DGraphBase< void, std::string >
edge(IDT from_id, IDT to_id) const	dg::DGraphBase< void, std::string >
edge(IDT from_id, IDT to_id)	dg::DGraphBase< void, std::string >
edge(IDT from_id, IDT to_id, Fn func, Args... args) const	dg::DGraphBase< void, std::string >	inline
edge(IDT from_id, IDT to_id, std::function< Ret(EdgeT_, Args...)> func, Args... args) const	dg::DGraphBase< void, std::string >	inline
edges() const	dg::DGraphBase< void, std::string >	inline
EdgeT_ typedef	dg::DGraphBase< void, std::string >	protected
EdgeT__ typedef	dg::DGraphBase< void, std::string >	protected
EdgeT_CR typedef	dg::DGraph< NodeT, EdgeT, IDT >	protected
EdgeT_CR_ typedef	dg::DGraphBase< void, std::string >	protected
EdgeT_R typedef	dg::DGraphBase< void, std::string >	protected
EdgeT_R_ typedef	dg::DGraphBase< void, std::string >	protected
g	dg::DGraphBase< void, std::string >	private
graph() const	dg::DGraphBase< void, std::string >	inlineprotected
graph()	dg::DGraphBase< void, std::string >	inlineprotected
hasEdge(IDT from_id, IDT to_id) const noexcept	dg::DGraphBase< void, std::string >	inline
hasNode(IDT id) const noexcept	dg::DGraphBase< void, std::string >	inline
insertEdge(IDT from_id, IDT to_id, bool to_exists=true)	dg::DGraph< NodeT, EdgeT, IDT >	inline
insertEdge(IDT from_id, IDT to_id, EdgeT_CR data, bool to_exists=true)	dg::DGraph< NodeT, EdgeT, IDT >	inline
DGraphBase< void, std::string >::insertEdge(IDT from_id, IDT to_id, EdgeT_CR data, bool to_exists=false)	dg::DGraphBase< void, std::string >
insertEdgeToExists(IDT from_id, IDT to_id)	dg::DGraphBase< void, std::string >	inline
insertEdgeToExists(IDT from_id, IDT to_id, EdgeT_CR data)	dg::DGraphBase< void, std::string >	inline
insertNode(IDT id, const NodeT &data)	dg::DGraph< NodeT, EdgeT, IDT >	inline
insertNode(IDT id, const NodeT &data, const _CN &cn)	dg::DGraph< NodeT, EdgeT, IDT >	inline
DGraphBase< void, std::string >::insertNode(IDT id)	dg::DGraphBase< void, std::string >
DGraphBase< void, std::string >::insertNode(IDT id, const _CN &cn, bool nodes_exist=false)	dg::DGraphBase< void, std::string >	protected
DGraphBase< void, std::string >::insertNode(IDT id, const std::map< IDT, void > &map, bool nodes_exist=false)	dg::DGraphBase< void, std::string >
insertSubGraph(const DGraphBase< void, IDT > &dg)	dg::DGraphBase< void, std::string >	inline
insertSubGraph(const DGraphBase< void, IDT > &dg, IDT id)	dg::DGraphBase< void, std::string >	inline
isConnected(IDT from_id, IDT to_id) const	dg::DGraphBase< void, std::string >	inline
maxWeightPath(IDT from_id, IDT to_id) const	dg::DGraphBase< void, std::string >	inline
maxWeightPath(IDT from_id, IDT to_id, Fn func, Args... args) const	dg::DGraphBase< void, std::string >	inline
maxWeightPath(IDT from_id, IDT to_id, std::function< Ret(EdgeT_, Args...)> func, Args... args) const	dg::DGraphBase< void, std::string >	inline
merge(const DGraphBase< void, IDT > &dg)	dg::DGraphBase< void, std::string >	inline
minOrMaxWeightPath(bool min, IDT from_id, IDT to_id, std::function< Ret(EdgeT_, Args...)> func, Args... args) const	dg::DGraphBase< void, std::string >	inlineprivate
minWeightPath(IDT from_id, IDT to_id) const	dg::DGraphBase< void, std::string >	inline
minWeightPath(IDT from_id, IDT to_id, Fn func, Args... args) const	dg::DGraphBase< void, std::string >	inline
minWeightPath(IDT from_id, IDT to_id, std::function< Ret(EdgeT_, Args...)> func, Args... args) const	dg::DGraphBase< void, std::string >	inline
node(IDT id) const	dg::DGraph< NodeT, EdgeT, IDT >	inline
node(IDT id)	dg::DGraph< NodeT, EdgeT, IDT >	inline
node_data	dg::DGraph< NodeT, EdgeT, IDT >	private
nodesID() const	dg::DGraphBase< void, std::string >
numEdges() const noexcept	dg::DGraphBase< void, std::string >	inline
numNodes() const noexcept	dg::DGraphBase< void, std::string >	inline
operator!=(const DGraph &dg) const	dg::DGraph< NodeT, EdgeT, IDT >	inline
DGraphBase< void, std::string >::operator!=(const DGraphBase< void, IDT > &dg) const	dg::DGraphBase< void, std::string >	inline
operator()(IDT from_id, IDT to_id) const	dg::DGraphBase< void, std::string >	inline
operator()(IDT from_id, IDT to_id)	dg::DGraphBase< void, std::string >	inline
operator+=(const DGraphBase< void, IDT > &dg)	dg::DGraphBase< void, std::string >	inline
operator==(const DGraph &dg) const	dg::DGraph< NodeT, EdgeT, IDT >	inline
DGraphBase< void, std::string >::operator==(const DGraphBase< void, IDT > &dg) const	dg::DGraphBase< void, std::string >	inline
operator[](IDT id) const	dg::DGraph< NodeT, EdgeT, IDT >	inline
operator[](IDT id)	dg::DGraph< NodeT, EdgeT, IDT >	inline
removeNode(IDT id, bool keep_edge=false)	dg::DGraph< NodeT, EdgeT, IDT >	inline
removeNodeConnectedEdges(IDT id)	dg::DGraphBase< void, std::string >	private
removeNodeIfExists(IDT id, bool keep_edge=false)	dg::DGraphBase< void, std::string >
size() const noexcept	dg::DGraphBase< void, std::string >	inline
strictCheck() const	dg::DGraph< NodeT, EdgeT, IDT >	inline