docs: Break lines at meaning boundaries

R/Koenigsberg.R

@@ -2,19 +2,16 @@
 #'
 #' @description
 #'
-#'   The Seven Bridges of Koenigsberg is a notable historical problem in
-#'   mathematics. Its negative resolution by Leonhard Euler in 1735 laid
-#'   the foundations of graph theory and presaged the idea of topology.
+#'   The Seven Bridges of Koenigsberg is a notable historical problem in mathematics.
+#'   Its negative resolution by Leonhard Euler in 1735 laid the foundations of graph theory and presaged the idea of topology.
 #'
-#'   The city of Koenigsberg in Prussia (now Kaliningrad, Russia) was set on
-#'   both sides of the Pregel River, and included two large islands which
-#'   were connected to each other and the mainland by seven bridges
+#'   The city of Koenigsberg in Prussia (now Kaliningrad, Russia) was set on both sides of the Pregel River,
+#'   and included two large islands which were connected to each other and the mainland by seven bridges
 #'
-#'   The problem was to find a walk through the city that would cross each
-#'   bridge once and only once. The islands could not be reached by any route
-#'   other than the bridges, and every bridge must have been crossed
-#'   completely every time (one could not walk half way onto the bridge and
-#'   then turn around and later cross the other half from the other side).
+#'   The problem was to find a walk through the city that would cross each bridge once and only once.
+#'   The islands could not be reached by any route other than the bridges,
+#'   and every bridge must have been crossed completely every time
+#'   (one could not walk half way onto the bridge and then turn around and later cross the other half from the other side).
 #'
 #'   Euler proved that the problem has no solution.
 #'
@@ -25,16 +22,13 @@
 #' @usage
 #' Koenigsberg
 #' @format
-#'   An undirected `igraph` graph object with vertex attributes
-#'   \sQuote{name} and \sQuote{Euler_letter}, the latter is the notation
-#'   from Eulers original paper; and edge attributes \sQuote{name} (the name
-#'   of the bridge) and \sQuote{Euler_letter}, again, Euler's notation
-#'   from his paper.
+#'   An undirected `igraph` graph object with vertex attributes \sQuote{name} and \sQuote{Euler_letter},
+#'   the latter is the notation from Eulers original paper;
+#'   and edge attributes \sQuote{name} (the name of the bridge) and \sQuote{Euler_letter}, again, Euler's notation from his paper.
 #'
 #'   This dataset is in the public domain.
 #' @references Leonhard Euler, “Solutio problematis ad geometriam situs pertinensis”
 #' Commentarii Academiae Scientarum Imperialis Petropolitanae, 8 (1736), 128–140 + Plate VIII.
-#' @source Wikipedia,
-#'   <https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg>
+#' @source Wikipedia, <https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg>
 #' @keywords datasets
 NULL

R/UKfaculty.R

@@ -1,28 +1,24 @@
 #' Friendship network of a UK university faculty
 #'
 #' @description
-#' The personal friendship network of a faculty of a UK
-#'   university, consisting of 81 vertices (individuals) and 817 directed
-#'   and weighted connections. The school affiliation of each individual is
-#'   stored as a vertex attribute. This dataset can serve as a testbed for
-#'   community detection algorithms.
+#' The personal friendship network of a faculty of a UK university,
+#'   consisting of 81 vertices (individuals) and 817 directed and weighted connections.
+#'   The school affiliation of each individual is stored as a vertex attribute.
+#'   This dataset can serve as a testbed for community detection algorithms.
 #'
 #' @name UKfaculty
 #' @docType data
 #' @usage
 #' UKfaculty
 #' @format
-#'   A directed `igraph` graph object with vertex attribute
-#'   \sQuote{Group}, the numeric id of the school affiliation, and edge
-#'   attribute \sQuote{weight}, i.e. the graph is weighted.
+#'   A directed `igraph` graph object with vertex attribute \sQuote{Group}, the numeric id of the school affiliation,
+#'   and edge attribute \sQuote{weight}, i.e. the graph is weighted.
 #'
-#'   This dataset is licensed under a Creative Commons
-#'   Attribution-Share Alike 2.0 UK: England & Wales License,
+#'   This dataset is licensed under a Creative Commons Attribution-Share Alike 2.0 UK: England & Wales License,
 #'   see <http://creativecommons.org/licenses/by-sa/2.0/uk/> for details.
 #'   Please cite the reference below if you use this dataset.
-#' @references Nepusz T., Petroczi A., Negyessy L., Bazso F.: Fuzzy
-#'   communities and the concept of bridgeness in complex
-#'   networks. Physical Review E 77:016107, 2008.
+#' @references Nepusz T., Petroczi A., Negyessy L., Bazso F.: Fuzzy communities and the concept of bridgeness in complex networks.
+#'   Physical Review E 77:016107, 2008.
 #'   \doi{10.1103/PhysRevE.77.016107}
 #' @source See reference below.
 #' @keywords datasets

R/USairports.R

@@ -2,12 +2,11 @@
 #'
 #' @description
 #'
-#'   The network of passanger flights between airports in the United
-#'   States. The data set was compiled based on flights in 2010
-#'   December. This network is directed and edge directions correspond to
-#'   flight directions. Each edge is specific to a single carrier aircraft
-#'   type. Multiple carriers between the same two airports are denoted by
-#'   multiple edges.
+#'   The network of passanger flights between airports in the United States.
+#'   The data set was compiled based on flights in 2010 December.
+#'   This network is directed and edge directions correspond to flight directions.
+#'   Each edge is specific to a single carrier aircraft type.
+#'   Multiple carriers between the same two airports are denoted by multiple edges.
 #'
 #'   See information about the included meta-data below.
 #'
@@ -18,35 +17,28 @@
 #' @usage
 #' USairports
 #' @format
-#'   A directed `igraph` graph object, with multiple edges. It has a
-#'   \sQuote{name} graph attribute, and several vertex and edge
-#'   attributes. The vertex attributes:
+#'   A directed `igraph` graph object, with multiple edges.
+#'   It has a \sQuote{name} graph attribute, and several vertex and edge attributes.
+#'   The vertex attributes:
 #'   \describe{
-#'     \item{name}{Symbolic vertex name, this is the three letter IATA
-#'       airport code.}
+#'     \item{name}{Symbolic vertex name, this is the three letter IATA airport code.}
 #'     \item{City}{City and state, where the airport is located.}
 #'     \item{Position}{Position of the airport, in WGS coordinates.}
 #'   }
 #'
 #'   Edge attributes:
 #'   \describe{
-#'     \item{Carrier}{Name of the airline. The network includes both
-#'       domestic and international carriers that performed at least one
-#'       flight in December of 2010.}
-#'     \item{Departures}{The number of departures (for a given airline and
-#'       aircraft type.}
-#'     \item{Seats}{The total number of seats available on the flights
-#'       carried out by a given airline, using a given aircraft type.}
-#'     \item{Passengers}{The total number of passangers on the flights
-#'       carried out by a given airline, using a given aircraft type.}
+#'     \item{Carrier}{Name of the airline.
+#'       The network includes both domestic and international carriers that performed at least one flight in December of 2010.}
+#'     \item{Departures}{The number of departures (for a given airline and aircraft type.}
+#'     \item{Seats}{The total number of seats available on the flights carried out by a given airline, using a given aircraft type.}
+#'     \item{Passengers}{The total number of passangers on the flights carried out by a given airline, using a given aircraft type.}
 #'     \item{Aircraft}{Type of the aircraft.}
 #'     \item{Distance}{The distance between the two airports, in miles.}
 #'   }
 #' @source
-#'   Most of this information was downloaded from The Research and
-#'   Innovative Technology Administration (RITA). See
-#'   <http://www.rita.dot.gov/about_rita/> for details. The airport
-#'   position information was collected from Wikipedia and other public
-#'   online sources.
+#'   Most of this information was downloaded from The Research and Innovative Technology Administration (RITA).
+#'   See <http://www.rita.dot.gov/about_rita/> for details.
+#'   The airport position information was collected from Wikipedia and other public online sources.
 #' @keywords datasets
 NULL

R/enron.R

@@ -14,11 +14,9 @@
 #'   A directed `igraph` graph object.
 #'
 #'   Graph attributes: \itemize{
-#'     \item \sQuote{LDC_names} The names of the 32 LDC catagories the emails
-#'     are classfied into by Michael W. Berry
+#'     \item \sQuote{LDC_names} The names of the 32 LDC catagories the emails are classfied into by Michael W. Berry
 #'     (<http://www.cis.jhu.edu/~parky/Enron/Anno_Topic_exp_LDC.pdf>)
-#'     \item \sQuote{LDC_desc} Longer descriptions of the 32 LDC
-#'     categories.
+#'     \item \sQuote{LDC_desc} Longer descriptions of the 32 LDC categories.
 #'     \item \sQuote{Citation} Additionally, see also the references below.
 #'     \item \sQuote{name}
 #'   }
@@ -30,60 +28,48 @@
 #'   }
 #'
 #'   Edge attributes: \itemize{
-#'     \item \sQuote{Time} When the email was sent. Note that some time
-#'     labels are from 1979, these are certainly wrong and you might want
-#'     to remove them before analyses that include time.
-#'     \item \sQuote{Reciptype} Recipient type, \sQuote{to}, \sQuote{cc} or
-#'     \sQuote{bcc}.
-#'     \item \sQuote{Topic} Assigned based on 3-means clustering of
-#'     randomly selected 3,120 out of all 125,409 messages, then NN
-#'     classification for the whole corpus. Note that topic 0 means an
-#'     outlier, e.g., too few words or all meaningless numbers in the
-#'     message body.
-#'     \item \sQuote{LDC_topic} Assigned based on Michael W. Berry's 2001
-#'     \dQuote{Annotated (by Topic) Enron Email Data Set.}
+#'     \item \sQuote{Time} When the email was sent.
+#'     Note that some time labels are from 1979,
+#'     these are certainly wrong and you might want to remove them before analyses that include time.
+#'     \item \sQuote{Reciptype} Recipient type, \sQuote{to}, \sQuote{cc} or \sQuote{bcc}.
+#'     \item \sQuote{Topic} Assigned based on 3-means clustering of randomly selected 3,120 out of all 125,409 messages,
+#'     then NN classification for the whole corpus.
+#'     Note that topic 0 means an outlier, e.g., too few words or all meaningless numbers in the message body.
+#'     \item \sQuote{LDC_topic} Assigned based on Michael W. Berry's 2001 \dQuote{Annotated (by Topic) Enron Email Data Set.}
 #'     (<http://www.cis.jhu.edu/~parky/Enron/Anno_Topic_exp_LDC.pdf>)
-#'     There are 32 topics. Topic "0" means an outlier, e.g., too few words
-#'     or all meaningless numbers in the message body, etc. Topic "-1"
-#'     means there is no matching topic.
+#'     There are 32 topics.
+#'     Topic "0" means an outlier, e.g., too few words or all meaningless numbers in the message body, etc.
+#'     Topic "-1" means there is no matching topic.
 #'   }
 #' @references
 #'   C.E. Priebe, J.M. Conroy, D.J. Marchette, and Y. Park,
-#'   Scan Statistics on Enron Graphs Computational and Mathematical
-#'   Organization Theory, Volume 11, Number 3, p229 - 247, October 2005,
-#'   Springer Science+Business Media B.V. \doi{10.1007/s10588-005-5378-z}
+#'   Scan Statistics on Enron Graphs Computational and Mathematical Organization Theory,
+#'   Volume 11, Number 3, p229 - 247, October 2005, Springer Science+Business Media B.V. \doi{10.1007/s10588-005-5378-z}
 #'
 #'   C.E. Priebe, J.M. Conroy, D.J. Marchette, and Y. Park,
-#'   Scan Statistics on Enron Graphs, SIAM International Conference on
-#'   Data Mining, Workshop on Link Analysis, Counterterrorism and Security,
-#'   Newport Beach, California, April 23, 2005.
+#'   Scan Statistics on Enron Graphs, SIAM International Conference on Data Mining,
+#'   Workshop on Link Analysis, Counterterrorism and Security, Newport Beach, California, April 23, 2005.
 #'
-#'   Gina Kolata, Enron Offers an Unlikely Boost to E-Mail Surveillance,
-#'   New York Times, Week in Review, May 22, 2005.
+#'   Gina Kolata, Enron Offers an Unlikely Boost to E-Mail Surveillance, New York Times, Week in Review, May 22, 2005.
 #'
-#'   C.E. Priebe, Scan Statistics on Enron Graphs, IPAM Summer Graduate
-#'   School: Intelligent Extraction of Information from Graphs and High
-#'   Dimensional Data, UCLA, July 11-29, 2005.
+#'   C.E. Priebe, Scan Statistics on Enron Graphs,
+#'   IPAM Summer Graduate School: Intelligent Extraction of Information from Graphs and High Dimensional Data,
+#'   UCLA, July 11-29, 2005.
 #'
-#'   C.E. Priebe, Scan Statistics on Enron Graphs, 2005 Fall Department
-#'   of Applied Mathematics and Statistics Seminars, September 15, 2005,
-#'   The Johns Hopkins University.
+#'   C.E. Priebe, Scan Statistics on Enron Graphs,
+#'   2005 Fall Department of Applied Mathematics and Statistics Seminars, September 15, 2005, The Johns Hopkins University.
 #'
-#'   Y. Park, C.E. Priebe, D.J. Marchette, Scan Statistics on Enron
-#'   Hypergraphs, Interface 2008, Durham, North Carolina, May 21, 2008,
+#'   Y. Park, C.E. Priebe, D.J. Marchette, Scan Statistics on Enron Hypergraphs, Interface 2008, Durham, North Carolina, May 21, 2008,
 #'
-#'   Y. Park, C.E. Priebe, D.J. Marchette, Anomaly Detection using Scan
-#'   Statistics on Enron Graphs and Hypergraphs, The Satellite Workshop of
-#'   the IASC 2008 Conference, Seoul, Korea, December 1-3, 2008.
+#'   Y. Park, C.E. Priebe, D.J. Marchette, Anomaly Detection using Scan Statistics on Enron Graphs and Hypergraphs,
+#'   The Satellite Workshop of the IASC 2008 Conference, Seoul, Korea, December 1-3, 2008.
 #'
-#'   Y. Park, C.E. Priebe, D.J. Marchette, A. Youssef, Anomaly Detection
-#'   using Scan Statistics on Time Series of Hypergraphs, Workshop on Link
-#'   Analysis, Counterterrorism and Security at the SIAM International
-#'   Conference on Data Mining, Sparks, Nevada, May 1-3, 2009,
+#'   Y. Park, C.E. Priebe, D.J. Marchette, A. Youssef, Anomaly Detection using Scan Statistics on Time Series of Hypergraphs,
+#'   Workshop on Link Analysis, Counterterrorism and Security at the SIAM International Conference on Data Mining,
+#'   Sparks, Nevada, May 1-3, 2009,
 #'
-#'   Y. Park, C.E. Priebe, A. Youssef, Anomaly Detection in Time Series of
-#'   Graphs using Fusion of Invariants, Computational and Mathematical
-#'   Organization Theory, submitted, 2010. \doi{10.1109/JSTSP.2012.2233712}
+#'   Y. Park, C.E. Priebe, A. Youssef, Anomaly Detection in Time Series of Graphs using Fusion of Invariants,
+#'   Computational and Mathematical Organization Theory, submitted, 2010. \doi{10.1109/JSTSP.2012.2233712}
 #' @source
 #'   <http://www.cis.jhu.edu/~parky/Enron/>
 NULL