43 #include "fastjet/ClusterSequence.hh"
54 vector<fastjet::PseudoJet> input_particles;
56 double px, py , pz, E;
57 while (cin >> px >> py >> pz >> E) {
122 vector<fastjet::PseudoJet> inclusive_jets = sorted_by_pt(clust_seq.
inclusive_jets(ptmin));
134 printf(
"%5s %15s %15s %15s\n",
"jet #",
"rapidity",
"phi",
"pt");
137 for (
unsigned int i = 0; i < inclusive_jets.size(); i++) {
138 printf(
"%5u %15.8f %15.8f %15.8f\n",
139 i, inclusive_jets[i].rap(), inclusive_jets[i].phi(),
140 inclusive_jets[i].perp());
std::vector< PseudoJet > inclusive_jets(const double ptmin=0.0) const
return a vector of all jets (in the sense of the inclusive algorithm) with pt >= ptmin.
the longitudinally invariant kt algorithm
std::string description() const
return a textual description of the current jet definition
RecombinationScheme
The various recombination schemes.
automatic selection of the best (based on N), including the LazyTiled strategies that are new to FJ3...
JetAlgorithm
the various families of jet-clustering algorithm
Strategy
the various options for the algorithmic strategy to adopt in clustering events with kt and cambridge ...
int main()
an example program showing how to use fastjet
Class to contain pseudojets, including minimal information of use to jet-clustering routines...
class that is intended to hold a full definition of the jet clusterer