#include <adjgraph.h>
Classes | |
class | const_iterator |
struct | value_type |
Public Types | |
typedef adj_list::iterator | adj_iterator |
typedef std::vector< edge_list > | adj_list |
typedef adj_list::const_iterator | const_adj_iterator |
typedef edge_list::const_iterator | const_edge_iterator |
typedef std::pair < const_edge_iterator, const_edge_iterator > | const_edge_range |
typedef indexer_type::const_iterator | const_indexer_iterator |
typedef edge_list::iterator | edge_iterator |
typedef std::vector< edge_type > | edge_list |
typedef std::pair < edge_iterator, edge_iterator > | edge_range |
typedef std::vector< E > | edge_store |
typedef std::pair< index_type, index_type > | edge_type |
typedef std::pair< index_type, bool > | index_result |
typedef std::vector< double > ::size_type | index_type |
typedef indexer_type::iterator | indexer_iterator |
typedef std::map< N, index_type > | indexer_type |
typedef std::vector< N > | node_list |
Public Member Functions | |
void | addEdge (const N &from, const N &to, const E &edge) |
index_type | addNode (const N &) |
adj_iterator | begin () |
const_adj_iterator | begin () const |
const_iterator | begin_iter () const |
void | clear () |
it clear everything! More... | |
void | dump_graph (void) const |
size_t | edge_size () const |
const E & | edgeData (index_type i) const |
edge_range | edges (index_type nodeIndex) |
const_edge_range | edges (index_type nodeIndex) const |
edge_range | edges (const N &) |
const_edge_range | edges (const N &) const |
adj_iterator | end () |
const_adj_iterator | end () const |
const_iterator | end_iter () const |
void | findRoots (edge_list &) const |
graph () | |
void | invert (graph &g) const |
const N & | nodeData (const edge_type &) const |
const N & | nodeData (index_type) const |
const N & | nodeData (const const_adj_iterator &) const |
index_result | nodeIndex (const N &) const |
bool | replace (const N &oldNode, const N &newNode) |
bool | replaceEdge (const E &ldEdge, const E &newEdge) |
adj_list::size_type | size () const |
void | swap (graph< N, E > &) |
~graph () | |
Private Attributes | |
adj_list | adjl_ |
edge_store | edges_ |
edge_list | emptyEdges_ |
indexer_type | indexer_ |
node_list | nodes_ |
Definition at line 12 of file adjgraph.h.
typedef adj_list::iterator graph< N, E >::adj_iterator |
Definition at line 124 of file adjgraph.h.
Definition at line 21 of file adjgraph.h.
typedef adj_list::const_iterator graph< N, E >::const_adj_iterator |
Definition at line 125 of file adjgraph.h.
typedef edge_list::const_iterator graph< N, E >::const_edge_iterator |
Definition at line 136 of file adjgraph.h.
typedef std::pair<const_edge_iterator, const_edge_iterator> graph< N, E >::const_edge_range |
Definition at line 140 of file adjgraph.h.
typedef indexer_type::const_iterator graph< N, E >::const_indexer_iterator |
Definition at line 131 of file adjgraph.h.
typedef edge_list::iterator graph< N, E >::edge_iterator |
Definition at line 134 of file adjgraph.h.
Definition at line 19 of file adjgraph.h.
typedef std::pair<edge_iterator,edge_iterator> graph< N, E >::edge_range |
Definition at line 138 of file adjgraph.h.
typedef std::vector<E> graph< N, E >::edge_store |
Definition at line 121 of file adjgraph.h.
typedef std::pair<index_type, index_type> graph< N, E >::edge_type |
Definition at line 17 of file adjgraph.h.
typedef std::pair<index_type, bool> graph< N, E >::index_result |
Definition at line 142 of file adjgraph.h.
typedef std::vector<double>::size_type graph< N, E >::index_type |
Definition at line 15 of file adjgraph.h.
typedef indexer_type::iterator graph< N, E >::indexer_iterator |
Definition at line 130 of file adjgraph.h.
typedef std::map<N, index_type> graph< N, E >::indexer_type |
Definition at line 129 of file adjgraph.h.
Definition at line 120 of file adjgraph.h.
Definition at line 147 of file adjgraph.h.
void graph< N, E >::addEdge | ( | const N & | from, |
const N & | to, | ||
const E & | edge | ||
) |
Definition at line 266 of file adjgraph.h.
Referenced by graph_combine(), graph< N, E >::invert(), and DDCompactViewImpl::position().
Definition at line 234 of file adjgraph.h.
References mps_fire::result.
|
inline |
Definition at line 197 of file adjgraph.h.
Referenced by TinyDomTest::allNodes(), TinyDomTest2::allNodes(), DDG4Builder::BuildGeometry(), GraphPath< N, E >::calcPaths(), ddstats(), GeometryInfoDump::dumpInfo(), and DDCompareCPV::operator()().
|
inline |
Definition at line 198 of file adjgraph.h.
|
inline |
Definition at line 190 of file adjgraph.h.
Referenced by DDStreamer::pos_write().
it clear everything!
Definition at line 401 of file adjgraph.h.
Referenced by Vispa.Views.WidgetView.WidgetView::closeEvent(), Vispa.Views.BoxDecayView.BoxDecayView::closeEvent(), Vispa.Share.FindAlgorithm.FindAlgorithm::findUsingFindDialog(), Vispa.Views.LineDecayView.LineDecayView::setDataObjects(), Vispa.Views.WidgetView.WidgetView::setDataObjects(), BeautifulSoup.Tag::setString(), Vispa.Views.TreeView.TreeView::updateContent(), Vispa.Views.TableView.TableView::updateContent(), Vispa.Views.BoxDecayView.BoxDecayView::updateContent(), and Vispa.Views.PropertyView.PropertyView::updateContent().
Definition at line 410 of file adjgraph.h.
Definition at line 194 of file adjgraph.h.
|
inline |
Definition at line 183 of file adjgraph.h.
Referenced by TinyDomTest::allNodes(), DDCheckPD(), graph< N, E >::const_iterator::value_type::edge(), DDCompareCPV::operator()(), and DDCompactViewImpl::~DDCompactViewImpl().
|
inline |
Definition at line 277 of file adjgraph.h.
Referenced by DDCheckAll(), DDErrorDetection::lp_cpv(), and DDCompactViewImpl::~DDCompactViewImpl().
|
inline |
Definition at line 285 of file adjgraph.h.
|
inline |
Definition at line 305 of file adjgraph.h.
References mps_fire::result.
|
inline |
Definition at line 199 of file adjgraph.h.
Referenced by TinyDomTest::allNodes(), TinyDomTest2::allNodes(), Types.LuminosityBlockRange::cppID(), Types.EventRange::cppID(), ddstats(), and DDCompareCPV::operator()().
|
inline |
Definition at line 200 of file adjgraph.h.
Referenced by Types.LuminosityBlockRange::cppID(), and Types.EventRange::cppID().
|
inline |
Definition at line 337 of file adjgraph.h.
References begin, end, and findQualityFiles::size.
Definition at line 424 of file adjgraph.h.
References graph< N, E >::addEdge(), and alignCSCRings::e.
|
inline |
Definition at line 317 of file adjgraph.h.
Referenced by TinyDomTest::allNodes(), TinyDomTest2::allNodes(), DDCheckAll(), DDCheckConnect(), graph< N, E >::const_iterator::value_type::from(), graph_combine(), DDErrorDetection::lp_cpv(), DDCompareCPV::operator()(), and graph< N, E >::const_iterator::value_type::to().
|
inline |
|
inline |
Definition at line 331 of file adjgraph.h.
|
inline |
Definition at line 252 of file adjgraph.h.
References mps_fire::result.
Referenced by DDErrorDetection::lp_cpv().
Definition at line 201 of file adjgraph.h.
Referenced by ntuple._Collection::__iter__(), ntuple._Collection::__len__(), TinyDomTest2::allNodes(), DDCheckAll(), DDCheckConnect(), graph< N, E >::const_iterator::operator++(), DDStreamer::pos_read(), and DDCompactViewImpl::~DDCompactViewImpl().
Definition at line 442 of file adjgraph.h.
References graph< N, E >::adjl_, graph< N, E >::edges_, graph< N, E >::emptyEdges_, graph< N, E >::indexer_, and graph< N, E >::nodes_.
Referenced by DDCompactViewImpl::swap().
Definition at line 215 of file adjgraph.h.
Referenced by graph< Node2, AnotherDummy2 >::begin(), graph< N, E >::const_iterator::value_type::edge(), graph< Node2, AnotherDummy2 >::end(), graph< Node2, AnotherDummy2 >::end_iter(), graph< N, E >::const_iterator::operator++(), graph< Node2, AnotherDummy2 >::size(), graph< N, E >::swap(), and graph< N, E >::const_iterator::value_type::to().
|
private |
Definition at line 221 of file adjgraph.h.
Referenced by graph< Node2, AnotherDummy2 >::edge_size(), graph< Node2, AnotherDummy2 >::edgeData(), and graph< N, E >::swap().
Definition at line 227 of file adjgraph.h.
Referenced by graph< N, E >::swap().
|
private |
Definition at line 224 of file adjgraph.h.
Referenced by graph< N, E >::swap().
Definition at line 218 of file adjgraph.h.
Referenced by graph< N, E >::swap().