Redesign CSF framework (RIPD-1361):

- Separate `Scheduler` from `BasicNetwork`.
- Add an event/collector framework for monitoring invariants and calculating statistics.
- Allow distinct network and trust connections between Peers.
- Add a simple routing strategy to support broadcasting arbitrary messages.
- Add a common directed graph (`Digraph`) class for representing network and trust topologies.
- Add a `PeerGroup` class for simpler specification of the trust and network topologies.
- Add a `LedgerOracle` class to ensure distinct ledger histories and simplify branch checking.
- Add a `Submitter` to send transactions in at fixed or random intervals to fixed or random peers.

Co-authored-by: Joseph McGee

src/test/csf.h

@@ -17,10 +17,20 @@
 */
 //==============================================================================
 
-#include <test/csf/Tx.h>
-#include <test/csf/Ledger.h>
 #include <test/csf/BasicNetwork.h>
+#include <test/csf/Histogram.h>
 #include <test/csf/Peer.h>
-#include <test/csf/UNL.h>
+#include <test/csf/PeerGroup.h>
+#include <test/csf/Proposal.h>
+#include <test/csf/Scheduler.h>
 #include <test/csf/Sim.h>
-#include <test/csf/Peer.h>
+#include <test/csf/SimTime.h>
+#include <test/csf/TrustGraph.h>
+#include <test/csf/Tx.h>
+#include <test/csf/collectors.h>
+#include <test/csf/Digraph.h>
+#include <test/csf/events.h>
+#include <test/csf/ledgers.h>
+#include <test/csf/random.h>
+#include <test/csf/submitters.h>
+#include <test/csf/timers.h>