IterOrbit
Subgraph isomorphism with iterative graphlet-orbit filtering
Loading...
Searching...
No Matches
SearchEngine Member List

This is the complete list of members for SearchEngine, including all inherited members.

backtrack(int depth)SearchEngineprivate
backtrack_cbj(int depth)SearchEngineprivate
backward_edgesSearchEngineprivate
backward_masksSearchEngineprivate
backward_non_neighborsSearchEngineprivate
candidate_listsSearchEngineprivate
computeLocalCandidates(int depth)SearchEngineprivate
conflict_bitsSearchEngineprivate
conflict_wordsSearchEngineprivate
conflicts(int depth)SearchEngineinlineprivate
count_onlySearchEngineprivate
count_overflowSearchEngineprivate
countLastLevel(int depth, uint64_t *used_by) constSearchEngineprivate
countOverflowed() constSearchEngineinline
data_graphSearchEngineprivate
enable_cbjSearchEngineprivate
fast_inverse_mappingSearchEngineprivate
fast_mappingSearchEngineprivate
fast_mapping_local_indexSearchEngineprivate
getIndexEntriesAfter() constSearchEngineinline
getIndexEntriesBefore() constSearchEngineinline
getLocalCandidatesPerDepth() constSearchEngineinline
getMatchCount() constSearchEngineinline
getMatches() constSearchEngineinline
getNodesPerDepth() constSearchEngineinline
identitySearchEngineprivate
in_useSearchEngineprivate
index_entries_afterSearchEngineprivate
index_entries_beforeSearchEngineprivate
inducedConflict(int u, int v, int &conflict_u) constSearchEngineprivate
intersect_bufferSearchEngineprivate
is_inducedSearchEngineprivate
limitReached() constSearchEngineinline
local_candidatesSearchEngineprivate
local_lenSearchEngineprivate
local_per_depthSearchEngineprivate
local_ptrSearchEngineprivate
match_countSearchEngineprivate
match_limitSearchEngineprivate
matchesSearchEngineprivate
mergeConflicts(int target_depth, int source_depth)SearchEngineprivate
nodes_per_depthSearchEngineprivate
orderSearchEngineprivate
order_positionSearchEngineprivate
pattern_graphSearchEngineprivate
run()SearchEngine
SearchEngine(const AppGraph &data, const AppGraph &pattern, const CandidateSets &candidates, const std::vector< int > &order, const std::unordered_map< int, int > &pivot, bool induced, bool cbj, bool count_only=false, bool edge_orbit_filter=false, const SymmetryBreaking *symmetry=nullptr)SearchEngine
setConflict(uint64_t *set, int d) constSearchEngineinlineprivate
setMatchLimit(long long limit, bool store)SearchEngineinline
smaller_depthsSearchEngineprivate
stoppedSearchEngineprivate
store_matchesSearchEngineprivate
symmetry_multiplierSearchEngineprivate