mathematics

We have now successfully added guidelines for importing and using algorithms in this repository, inside other algorithms. This has been done to reduce code repetition and uphold code quality. Some functions do implement their own versions of data structures and helper functions, as previously, algorithms were supposed to be completely self contained. This issue initiates a search and fix so that a

Current behavior:

root [0] TFile f("root://eospublic.cern.ch//eos/root-eos/benchmark/Run2012B_SingleMu.root")
Error in <TFile::TFile>: file /eos/root-eos/benchmark/Run2012B_SingleMu.root does not exist
(TFile &) Name: /eos/root-eos/benchmark/Run2012B_SingleMu.root Title:

Desirable behavior:

root [0] TFile f("root://eospublic.cern.ch//eos/root-eos/benchmark/Run2012B_Single

IEEE 754 recommends (but does not require) a compound function, which is in the process of being standardized for C and C++; we should expose it in swift-numerics. The simplest, most literal translation of the operation into Swift would be:

extension RealFunctions {
  /// (1+x)ⁿ
  /// 
  /// Returns NaN if x < -1.
  static func compound(_ x: Self, _ n: Int) -> Self {
    // not

What is the feature or improvement you would like to see?

A function that computes the graph center, and the graph periphery. The graph center is the set of vertices that has minimal eccentricity. The periphery is the set with maximal eccentricity.

Use cases for the feature

This is a standard concept in graph theory.

**Implementatio