Example of thread with custom stack size

Author: EbTech

README.md

@@ -5,6 +5,7 @@ A collection of famous data structures and algorithms, emphasizing beauty and cl
 This repository is distributed under the [MIT License](LICENSE). The license text need not be included in contest submissions, though I would appreciate linking back to this repo for others to find. Enjoy!
 
 ## Academic Programming Competitions
+
 The original intent of this project was to build a reference for use in programming competitions such as [Codeforces](http://codeforces.com) and the [Google Code Jam](https://code.google.com/codejam). As a result, it contains algorithms that are frequently useful to have in one's toolkit, with an emphasis on making the code concise and easy to modify in time-constrained settings.
 
 Most competitive programmers use C/C++ because it allows for fast coding as well as fast execution. However, these languages are notoriously unsafe, wasting a considerable share of the contestant's time and attention on accident prevention. Java is the next most popular choice, offering a bit of safety at some expense to coding and execution speed. To my delight, I found that Rust provides a lot more safety than Java without the visual clutter, and it's *fast*. 

tests/example_problem.rs

@@ -1,16 +1,23 @@
-/*extern crate algorithms;
-
+// To make a single-file Codeforces contest submission, dump the module contents
+// directly here instead of these use statements.
+extern crate algorithms;
 use algorithms::scanner::*;
 use algorithms::graph::*;
 
-#[test]
-fn integration() {
+fn main1() {
     let mut scan = Scanner::new();
-    let n = scan.next::<usize>();
-    let mut tree = Graph::new(n, n-1);
-    for e in 0..n-1 {
-        let u = scan.next::<usize>() - 1;
-        let v = scan.next::<usize>() - 1;
-        tree.add_edge(u, v);
+    let mut graph = Graph::new(1, 0);
+    for _ in 0..0 {
+        let u = scan.next::<usize>();
+        let v = scan.next::<usize>();
+        graph.add_edge(u, v);
     }
-}*/
+}
+
+#[test]
+fn integration() {
+    // If your contest solution requires a lot of stack space, make sure to
+    // run it on a custom thread.
+    std::thread::Builder::new().stack_size(50_000_000)
+        .spawn(main1).unwrap().join().unwrap();
+}