Clean up 01-Air-Routes sample

michaelnchin · michaelnchin · commit b02d06731487 · 2024-08-15T18:55:28.000-07:00
diff --git a/src/graph_notebook/notebooks/02-Neptune-Analytics/04-OpenCypher-Over-RDF/01-Air-Routes.ipynb b/src/graph_notebook/notebooks/02-Neptune-Analytics/04-OpenCypher-Over-RDF/01-Air-Routes.ipynb
@@ -346,12 +346,6 @@
     "The journey between Manchester-Boston and Helsinki has a minimum of three connecting flights. In total, there are 118 possible routes you could take to make the journey. Here we show the RDFS labels of the Route nodes in the graph:"
    ]
   },
-  {
-   "cell_type": "markdown",
-   "id": "2fae2627ca1adc97",
-   "metadata": {},
-   "source": []
-  },
   {
    "cell_type": "code",
    "execution_count": null,

Original file line number	Diff line number	Diff line change
`@@ -346,12 +346,6 @@`
`346`	`346`	`"The journey between Manchester-Boston and Helsinki has a minimum of three connecting flights. In total, there are 118 possible routes you could take to make the journey. Here we show the RDFS labels of the Route nodes in the graph:"`
`347`	`347`	`]`
`348`	`348`	`},`
`349`		`- {`
`350`		`- "cell_type": "markdown",`
`351`		`- "id": "2fae2627ca1adc97",`
`352`		`- "metadata": {},`
`353`		`- "source": []`
`354`		`- },`
`355`	`349`	`{`
`356`	`350`	`"cell_type": "code",`
`357`	`351`	`"execution_count": null,`