contains all subgraphs. More...

Collaboration diagram for SectorGraph< FilterType >:

[legend]

Public Types
using	Iterator = typename std::unordered_map< SubGraphID, SubGraph< FilterType > >::iterator
	for better readability.

Public Member Functions
	SectorGraph (const std::vector< FilterType > &fIDs)
	constructor expects filterIDs.

Iterator	find (SubGraphID idChain)
	find entry. More...

Iterator	begin ()
	returns begin of subGraphs.

Iterator	end ()
	returns end of subGraphs.

unsigned	size () const
	returns number of collected subgraphs so far.

unsigned long	nFoundTotal () const
	returns number of occurances for all subGraphs found together.

Iterator	add (SubGraphID &newID)
	add new subgraph if not added already.

std::string	print (bool fullPrint=true) const
	returns a string giving an overview of the graph.

unsigned	pruneGraph (double rarenessCut)
	returns removed occurances. More...

int	getAbsThreshold (int relThreshold)
	Get the absolute treshold (# nfound) given a relative threshold.

unsigned	pruneGraphBeforeTraining (int absThreshold)
	returns removed occurances.

void	output_nfound ()
	Output in a txt file id & nfound of subgraphs.

void	updateSubLayerIDs ()
	finds sectors having inner sectors in same layer and update them in the subGraph-ID.

std::vector< FullSecID >	getAllFullSecIDsOfSensor (VxdID sensor)
	returns a Vector containing all FullSecIDs found for given sensor.

const std::vector< FilterType > &	getFilterTypes () const
	returns a const reference to the filterTypes stored in this graph

Protected Attributes
std::unordered_map< SubGraphID, SubGraph< FilterType > >	m_subgraphs
	contains all subgraphs.

std::vector< FilterType >	m_filterIDs
	ids of all filterTypes to be stored by subGraphs.

Detailed Description

contains all subgraphs.

The ids used for the subgraphs have to be sorted from outer to inner sectors.

Definition at line 31 of file SectorGraph.h.

Member Function Documentation

Iterator find ( SubGraphID idChain )

inline

find entry.

returns end() if not found.

Definition at line 46 of file SectorGraph.h.

46 { return m_subgraphs.find(idChain); }

std::unordered_map< SubGraphID, SubGraph< FilterType > > m_subgraphs

contains all subgraphs.

Definition: SectorGraph.h:33

unsigned pruneGraph ( double rarenessCut )

inline

returns removed occurances.

vector of trunks (= outer sector(s)):

Definition at line 89 of file SectorGraph.h.

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