seams-core v2.14.0
libyodaLib, the C++ engine of d-SEAMS
Loading...
Searching...
No Matches
franzblau.hpp File Reference

File for generating shortest-path rings according to the Franzblau algorithm. More...

#include <algorithm>
#include <array>
#include <fstream>
#include <iostream>
#include <iterator>
#include <cmath>
#include <memory>
#include <sstream>
#include <string>
#include <vector>
#include <cage.hpp>
#include <mol_sys.hpp>
#include <seams_input.hpp>
#include <seams_output.hpp>

Go to the source code of this file.

Classes

struct  primitive::Vertex
 This is a collection of elements, for each point, required for graph traversal. More...
struct  primitive::Graph
 This is a per-frame object, containing all the vertices for the particular frame, along with the vector of rings generated. More...
class  primitive::RingUpdater
 Exact frame-to-frame maintenance of the primitive ring network. More...
struct  primitive::RingSearchSplit

Namespaces

namespace  primitive
 Functions for generating primitive rings.

Enumerations

enum class  primitive::RingRows { primitive::Auto , primitive::Vectors , primitive::Packed }

Functions

std::vector< std::vector< int > > primitive::ringNetwork (const std::vector< std::vector< int > > &nList, int maxDepth)
std::vector< int > primitive::atomRingSizeCounts (const std::vector< std::vector< int > > &nList, int maxDepth)
std::vector< std::vector< int > > primitive::ringNetworkMinSize (const std::vector< std::vector< int > > &nList, int maxDepth, int minDepth)
std::vector< std::vector< int > > primitive::ringNetwork (const std::vector< std::vector< int > > &nList, int maxDepth, RingRows rows)
std::vector< std::vector< int > > primitive::ringNetwork (const std::vector< std::vector< int > > &nList, int maxDepth, const std::vector< char > &sources)
std::vector< std::vector< int > > primitive::ringNetwork (const std::vector< int > &offsets, const std::vector< int > &cols, int maxDepth, const std::vector< char > &sources={})
void primitive::ringSizeCounts (const std::vector< int > &offsets, const std::vector< int > &cols, int maxDepth, int *counts, int countsLen)
std::vector< std::vector< int > > primitive::ringNetworkBalls (const std::vector< std::vector< int > > &nList, int maxDepth)
int primitive::lastRingSearchUsedBalls ()
Graph primitive::populateGraphFromNListID (molSys::PointCloud< molSys::Point< double >, double > &yCloud, const std::vector< std::vector< int > > &neighHbondList)
Graph primitive::populateGraphFromIndices (const std::vector< std::vector< int > > &nList)
void primitive::restoreEdgesFromIndices (Graph &fullGraph, const std::vector< std::vector< int > > &nList)
Graph primitive::countAllRingsFromIndex (const std::vector< std::vector< int > > &neighHbondList, int maxDepth)
 Creates a vector of vectors of all possible rings.
void primitive::removeNonSPrings (Graph &fullGraph)
 Removes the non-SP rings, using the Franzblau shortest path criterion.
int primitive::findRings (Graph &fullGraph, int v, std::vector< int > &visited, int maxDepth, int depth, int root=-1)
 Main function that searches for all rings.
int primitive::shortestPath (Graph &fullGraph, int v, int goal, std::vector< int > &path, std::vector< int > &visited, int maxDepth, int depth=1)
 Calculates the shortest path.
Graph primitive::clearGraph (Graph &currentGraph)
 Function for clearing vectors in Graph after multiple usage.
RingSearchSplit primitive::lastRingSearchSplit ()
 Balls, source enumeration and the gather from the last ringNetwork call.
void primitive::setPhaseTiming (bool on)
 When set, ringNetwork records the primitive-test time in the split.
double primitive::takePrimitiveMs ()
 Primitive-test milliseconds from the last timed ringNetwork, then zero.
void primitive::setSourceWork (double *microseconds)

Detailed Description

File for generating shortest-path rings according to the Franzblau algorithm.

Definition in file franzblau.hpp.