Simplified Logistics Problem

You have a string representing a path of cargo. The string consists of lowercase letters where each letter represents a different path node. Some nodes in the network are represented by empty spaces and need to be handled. Write a program that can parse this string and return a path without spaces. Input: A string representing a path which may include spaces. Output: A string representing the path without spaces. Example: Input: 'a b c d' Output: 'abcd' Example Input 'a b c d'