<a href="#1">Sparse matrices as graphs</a></li>
               <li><a href="#3">Weighted and directed graphs</a></li>
               <li><a href="#4">Loading helper</a></li>
               <li><a href="#6">Search algorithms</a></li>
               <li><a href="#13">Shortest paths</a></li>
               <li><a href="#14">Minimum spanning trees</a></li>
               <li><a href="#21">Connected components</a></li>
               <li><a href="#28">Statistics</a></li>
               <li><a href="#34">Efficien