added skip test and corrected typo

notebooks/applications/CostMatrix.ipynb

@@ -5,6 +5,7 @@
    "metadata": {},
    "source": [
     "# How to compute a _Cost Matrix_ by replicating data\n",
+    "# Skip notebook test\n",
     "\n",
     "### Approach\n",
     "A simple approach to creating a cost matrix is to run All-Source Shortest Path (ASSP), however cuGraph currently does not have an All-Source Shortest Path (ASSP) algorithm.  One is on the roadmap, based on Floyd-Warshall, but that doesn't help us today. Luckily there is a work around if the graph to be processed is small.  The hack is to run ASSP by creating a lot of copies of the graph and running the Single Source Shortest Path (SSSP) on one seed per graph copy. Since each SSSP run within its own disjoint component, there is no issue with path collisions between seeds.  \n"
@@ -31,7 +32,7 @@
     "* Number of Vertices:  1,005\n",
     "* Number of Edges:    25,571\n",
     "\n",
-    "We are using this dataset since it is small with a few community, meaning that there are paths to be found."
+    "We are using this dataset since it is small with a few communities, meaning that there are paths to be found."
    ]
   },
   {