Icon

Challenge 27 - Challenge 27 - Traveling in Europe_​PV solution

<p><strong>Challenge 27 - Traveling in Europe</strong></p><p><strong>Level: </strong>Hard<br><strong><br></strong>The end of the year is coming and you are ready to organize a roadtrip around Europe. To facilitate its planning, you decide to create some interactive dashboards. Given a dataset with distances (in km) between many major European cities, you want to:<br><em><br>- </em>Create a component that identifies a network of cities that are connected by at most a given distance (e.g., a network of cities that are at most 200km apart from one another);<br>- Calculate and display different properties of each city in this network (e.g., which city is more central?); and<br>- Calculate the shortest paths between two selected cities in this network.<br><br>This can help you determine where your trip will start and which cities you will visit: two planning tools that come in handy if you want to check as many cities as possible within certain distance constraints. <strong>Hint: </strong>Use KNIME's <strong>Network Mining</strong> and <strong>Distance Matrix</strong> extensions to identify a network of cities and compute their properties and shortest distances.<br><em><br>Beginner-friendly objective: </em>Read the dataset on distances between cities in Europe.<em><br>Intermediate-friendly objective: </em>Create an interactive dashboard that allows you to specify a maximum distance <em>X</em> between two cities, creating a visual network of all identified cities that are at most <em>X</em>km apart from one another.<em><br>Advanced objectives: </em>(1) Gather network information for each city in your network (e.g., their degree, closeness, weight) and organize the information as a visual table. (2) Create an interactive visualization that allows you to select two cities from your network, returning the shortest path between them with all the cities that are in between them.</p>

Challenge 27 - Traveling in Europe

Challenge 27 - Traveling in Europe


Level: Hard

The end of the year is coming and you are ready to organize a roadtrip around Europe. To facilitate its planning, you decide to create some interactive dashboards. Given a dataset with distances (in km) between many major European cities, you want to:

-
Create a component that identifies a network of cities that are connected by at most a given distance (e.g., a network of cities that are at most 200km apart from one another);
- Calculate and display different properties of each city in this network (e.g., which city is more central?); and
- Calculate the shortest paths between two selected cities in this network.

This can help you determine where your trip will start and which cities you will visit: two planning tools that come in handy if you want to check as many cities as possible within certain distance constraints. Hint: Use KNIME's Network Mining and Distance Matrix extensions to identify a network of cities and compute their properties and shortest distances.

Beginner-friendly objective:
Read the dataset on distances between cities in Europe.
Intermediate-friendly objective:
Create an interactive dashboard that allows you to specify a maximum distance X between two cities, creating a visual network of all identified cities that are at most Xkm apart from one another.
Advanced objectives:
(1) Gather network information for each city in your network (e.g., their degree, closeness, weight) and organize the information as a visual table. (2) Create an interactive visualization that allows you to select two cities from your network, returning the shortest path between them with all the cities that are in between them.

CSV Reader
Appendthe colorto city1
Color Appender
1st city
RowID
Create file path in the workflow data area
2nd city
Unpivot
distance=0
Row Filter
distance
Duplicate Row Filter
Colorthe cities
Color Manager
Read data on distances betweencities in Europe (in km)
Distance Matrix Reader
pathway
String Manipulation
Appendthe colorto city2
Color Appender
Visualization
Proper table
Table Manipulator
Get citiesinto rows
Unpivot
Column Renamer
Component
Check cities's infoand shortest sequenceof cities between a given pairof cities (start and end)
Dashboard for Traveling
Aggregate thecities into a sortedlist
Column Aggregator
Filter outthe same cities
Row Filter
Select a maximumdistance to connect anytwo cities and checkthe result
Create Cities Graph
Deletethe listidentifiers
String Manipulation

Nodes

Extensions

Links