15#ifndef SEAMS_FRANZBLAU_H_
16#define SEAMS_FRANZBLAU_H_
110 std::vector<std::vector<int>>
119std::vector<std::vector<int>>
ringNetwork(
const std::vector<std::vector<int>> &nList,
132 int maxDepth,
int minDepth);
140std::vector<std::vector<int>>
ringNetwork(
const std::vector<std::vector<int>> &nList,
145std::vector<std::vector<int>>
ringNetwork(
const std::vector<std::vector<int>> &nList,
147 const std::vector<char> &sources);
153std::vector<std::vector<int>>
ringNetwork(
const std::vector<int> &offsets,
154 const std::vector<int> &cols,
int maxDepth,
155 const std::vector<char> &sources = {});
160void ringSizeCounts(
const std::vector<int> &offsets,
const std::vector<int> &cols,
161 int maxDepth,
int *counts,
int countsLen);
167std::vector<std::vector<int>>
183 const std::vector<std::vector<int>> &neighHbondList);
194 const std::vector<std::vector<int>> &nList);
204[[nodiscard]]
int findRings(
Graph &fullGraph,
int v, std::vector<int> &visited,
int maxDepth,
205 int depth,
int root = -1);
209 std::vector<int> &visited,
int maxDepth,
int depth = 1);
237 const std::vector<std::vector<
int>> &
238 update(const std::vector<std::vector<
int>> &nList);
269 std::unique_ptr<Impl> impl_;
File for cage types for topological network criteria.
int lastRecomputedSources() const
void setFullPassFraction(double fraction)
RingUpdater(RingUpdater &&) noexcept
RingUpdater(int maxDepth)
int lastChangedBonds() const
const std::vector< std::vector< int > > & update(const std::vector< std::vector< int > > &nList)
double lastChangedBondFraction() const
Changed bonds per molecule on the last update.
int lastBallsRefreshed() const
Vertices whose bounded balls were rebuilt on the last update.
void setBondCrossover(double changedBondsPerMolecule)
The main molecular system handler.
Functions for generating primitive rings.
double takePrimitiveMs()
Primitive-test milliseconds from the last timed ringNetwork, then zero.
Graph populateGraphFromNListID(molSys::PointCloud< molSys::Point< double >, double > &yCloud, const std::vector< std::vector< int > > &neighHbondList)
int findRings(Graph &fullGraph, int v, std::vector< int > &visited, int maxDepth, int depth, int root=-1)
Main function that searches for all rings.
void restoreEdgesFromIndices(Graph &fullGraph, const std::vector< std::vector< int > > &nList)
Graph populateGraphFromIndices(const std::vector< std::vector< int > > &nList)
void removeNonSPrings(Graph &fullGraph)
Removes the non-SP rings, using the Franzblau shortest path criterion.
void ringSizeCounts(const std::vector< int > &offsets, const std::vector< int > &cols, int maxDepth, int *counts, int countsLen)
int shortestPath(Graph &fullGraph, int v, int goal, std::vector< int > &path, std::vector< int > &visited, int maxDepth, int depth=1)
Calculates the shortest path.
std::vector< std::vector< int > > ringNetwork(const std::vector< std::vector< int > > &nList, int maxDepth)
int lastRingSearchUsedBalls()
std::vector< std::vector< int > > ringNetworkBalls(const std::vector< std::vector< int > > &nList, int maxDepth)
RingSearchSplit lastRingSearchSplit()
Balls, source enumeration and the gather from the last ringNetwork call.
void setPhaseTiming(bool on)
When set, ringNetwork records the primitive-test time in the split.
std::vector< std::vector< int > > ringNetworkMinSize(const std::vector< std::vector< int > > &nList, int maxDepth, int minDepth)
Graph countAllRingsFromIndex(const std::vector< std::vector< int > > &neighHbondList, int maxDepth)
Creates a vector of vectors of all possible rings.
void setSourceWork(double *microseconds)
Graph clearGraph(Graph ¤tGraph)
Function for clearing vectors in Graph after multiple usage.
std::vector< int > atomRingSizeCounts(const std::vector< std::vector< int > > &nList, int maxDepth)
This contains a collection of points; contains information for a particular frame.
This contains per-particle information.
This is a per-frame object, containing all the vertices for the particular frame, along with the vect...
std::vector< std::vector< int > > rings
std::vector< Vertex > pts
This is a collection of elements, for each point, required for graph traversal.
std::vector< int > neighListIndex
This is the index according to pointCloud.