multimodalrouter 0.1.0__tar.gz

multimodalrouter-0.1.0/LICENSE.md

@@ -0,0 +1,10 @@
+MIT License
+
+Copyright (c) 2025 Tobias Karusseit
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+

multimodalrouter-0.1.0/MANIFEST.in

@@ -0,0 +1,2 @@
+include LICENSE
+include README.md

multimodalrouter-0.1.0/PKG-INFO

@@ -0,0 +1,115 @@
+Metadata-Version: 2.4
+Name: multimodalrouter
+Version: 0.1.0
+Summary: A graph-based routing library for dynamic routing.
+Author-email: Tobias Karusseit <karusseittobi@gmail.com>
+License: MIT License
+        
+        Copyright (c) 2025 Tobias Karusseit
+        
+        Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+        
+        The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+        
+        THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+        
+        
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE.md
+Requires-Dist: colorama>=0.4.6
+Requires-Dist: dill>=0.4.0
+Requires-Dist: filelock>=3.19.1
+Requires-Dist: fsspec>=2025.9.0
+Requires-Dist: Jinja2>=3.1.6
+Requires-Dist: MarkupSafe>=3.0.2
+Requires-Dist: mpmath>=1.3.0
+Requires-Dist: networkx>=3.5
+Requires-Dist: numpy>=2.3.3
+Requires-Dist: pandas>=2.3.2
+Requires-Dist: parquet>=1.3.1
+Requires-Dist: ply>=3.11
+Requires-Dist: pyarrow>=21.0.0
+Requires-Dist: python-dateutil>=2.9.0.post0
+Requires-Dist: pytz>=2025.2
+Requires-Dist: setuptools>=80.9.0
+Requires-Dist: six>=1.17.0
+Requires-Dist: sympy>=1.14.0
+Requires-Dist: thriftpy2>=0.5.3
+Requires-Dist: tqdm>=4.67.1
+Requires-Dist: typing_extensions>=4.15.0
+Requires-Dist: tzdata>=2025.2
+Provides-Extra: torch
+Requires-Dist: torch>=2.8.0; extra == "torch"
+Dynamic: license-file
+
+# Multi Modal Router
+
+The Multi Modal Router is a graph-based routing engine that allows you to build and query any hub-based network. It supports multiple transport modes like driving, flying, or shipping, and lets you optimize routes by distance, time, or custom metrics. It can be expanded to any n-dimensional space making it versatile in any coordinate space
+
+> NOTE: This project is a work in progress and features might be added and or changed
+
+# In depth Documentation
+
+[installation guide](./docs/installation.md)
+
+[graph module documentation](./docs/graph.md)
+
+[code examples](./docs/examples/demo.py)
+
+[command line interface documentation](./docs/cli.md)
+
+[utilities documentation](./docs/utils.md)
+
+
+# Features
+
+## Building Freedom / Unlimited Usecases
+
+The graph can be build from any data aslong as the required fields are present ([example](./docs/examples/demoData.csv)). Whether your data contains real world places or you are working in a more abstract spaces with special coordinates and distance metrics the graph will behave the same (with minor limitations due to dynamic distance calculation, but not a problem when distances are already precomputed. [solutions](./docs/graph.md#advanced-options)).
+
+#### Example Usecases
+
+- real world flight router
+    - uses data with real flight data and actuall airport coordinates
+    - builds a graph with `airport` [Hubs](./docs/graph.md#hub)
+    - connects `airports` based on flight routes
+    - `finds` the `shortest flights` or `multi leg routes` to get from `A` to `B`
+    - simple example implementation [here](./docs/examples/flightRouter/main.py)
+
+- social relation ship graph
+    - uses user data like a social network where users are connected through others via a group of other users
+    - builds a graph with `users` as Hubs
+    - connects users based on know interactions or any other connection meric
+    - `finds` users that are likely to `share`; `interests`, `friends`, `a social circle`, etc.
+
+- coordinate based game AI and pathfinding
+    - uses a predefined path network (e.g. a simple maze)
+    - `builds` the garph representation of the network
+    - `finds` the shortest way to get from any point `A` to any other point `B` in the network
+    - you can checkout a simple example implementation for a maze pathfinder [here](./docs/examples/mazePathfinder/main.py)
+
+![example from the maze solver](./docs/solvedMaze1.png)
+
+## Important considerations for your usecase
+
+Depending on your usecase and datasets some features may not be usable see solutions below
+
+### potential problems based on use case
+
+**Please check your data for the following**
+
+| distance present | coordinate format | unusable features | special considerations |
+|------------------|-------------------|-------------------|------------------------|
+|      YES         |      degrees      |      None         |        None|
+|      YES|not degrees| runtime distance calculations| set [drivingEnabled = False](./docs/graph.md#args) or do [this](./docs/graph.md#swap-distance-method)|
+| NO | degrees | None | distances must be calculated when [preprocessing](./src/multimodalrouter/utils/preprocessor.py) |
+| NO | not degrees | **ALL** | **U cant build the graph with neither distances or supported coordinates!** [**solution**](./docs/graph.md#swap-distance-method)
+
+[**example dataframe with the required fields**](./docs/examples/demoData.csv)
+
+### License
+
+[see here](./LICENSE.md)
+
+

multimodalrouter-0.1.0/README.md

@@ -0,0 +1,70 @@
+# Multi Modal Router
+
+The Multi Modal Router is a graph-based routing engine that allows you to build and query any hub-based network. It supports multiple transport modes like driving, flying, or shipping, and lets you optimize routes by distance, time, or custom metrics. It can be expanded to any n-dimensional space making it versatile in any coordinate space
+
+> NOTE: This project is a work in progress and features might be added and or changed
+
+# In depth Documentation
+
+[installation guide](./docs/installation.md)
+
+[graph module documentation](./docs/graph.md)
+
+[code examples](./docs/examples/demo.py)
+
+[command line interface documentation](./docs/cli.md)
+
+[utilities documentation](./docs/utils.md)
+
+
+# Features
+
+## Building Freedom / Unlimited Usecases
+
+The graph can be build from any data aslong as the required fields are present ([example](./docs/examples/demoData.csv)). Whether your data contains real world places or you are working in a more abstract spaces with special coordinates and distance metrics the graph will behave the same (with minor limitations due to dynamic distance calculation, but not a problem when distances are already precomputed. [solutions](./docs/graph.md#advanced-options)).
+
+#### Example Usecases
+
+- real world flight router
+    - uses data with real flight data and actuall airport coordinates
+    - builds a graph with `airport` [Hubs](./docs/graph.md#hub)
+    - connects `airports` based on flight routes
+    - `finds` the `shortest flights` or `multi leg routes` to get from `A` to `B`
+    - simple example implementation [here](./docs/examples/flightRouter/main.py)
+
+- social relation ship graph
+    - uses user data like a social network where users are connected through others via a group of other users
+    - builds a graph with `users` as Hubs
+    - connects users based on know interactions or any other connection meric
+    - `finds` users that are likely to `share`; `interests`, `friends`, `a social circle`, etc.
+
+- coordinate based game AI and pathfinding
+    - uses a predefined path network (e.g. a simple maze)
+    - `builds` the garph representation of the network
+    - `finds` the shortest way to get from any point `A` to any other point `B` in the network
+    - you can checkout a simple example implementation for a maze pathfinder [here](./docs/examples/mazePathfinder/main.py)
+
+![example from the maze solver](./docs/solvedMaze1.png)
+
+## Important considerations for your usecase
+
+Depending on your usecase and datasets some features may not be usable see solutions below
+
+### potential problems based on use case
+
+**Please check your data for the following**
+
+| distance present | coordinate format | unusable features | special considerations |
+|------------------|-------------------|-------------------|------------------------|
+|      YES         |      degrees      |      None         |        None|
+|      YES|not degrees| runtime distance calculations| set [drivingEnabled = False](./docs/graph.md#args) or do [this](./docs/graph.md#swap-distance-method)|
+| NO | degrees | None | distances must be calculated when [preprocessing](./src/multimodalrouter/utils/preprocessor.py) |
+| NO | not degrees | **ALL** | **U cant build the graph with neither distances or supported coordinates!** [**solution**](./docs/graph.md#swap-distance-method)
+
+[**example dataframe with the required fields**](./docs/examples/demoData.csv)
+
+### License
+
+[see here](./LICENSE.md)
+
+

multimodalrouter-0.1.0/pyproject.toml

@@ -0,0 +1,52 @@
+[build-system]
+requires = ["setuptools>=61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "multimodalrouter"
+version = "0.1.0"
+description = "A graph-based routing library for dynamic routing."
+readme = "README.md"
+license = { file = "LICENSE.md" }
+authors = [
+  { name="Tobias Karusseit", email="karusseittobi@gmail.com" }
+]
+dependencies = [
+    "colorama>=0.4.6",
+    "dill>=0.4.0",
+    "filelock>=3.19.1",
+    "fsspec>=2025.9.0",
+    "Jinja2>=3.1.6",
+    "MarkupSafe>=3.0.2",
+    "mpmath>=1.3.0",
+    "networkx>=3.5",
+    "numpy>=2.3.3",
+    "pandas>=2.3.2",
+    "parquet>=1.3.1",
+    "ply>=3.11",
+    "pyarrow>=21.0.0",
+    "python-dateutil>=2.9.0.post0",
+    "pytz>=2025.2",
+    "setuptools>=80.9.0",
+    "six>=1.17.0",
+    "sympy>=1.14.0",
+    "thriftpy2>=0.5.3",
+    "tqdm>=4.67.1",
+    "typing_extensions>=4.15.0",
+    "tzdata>=2025.2",
+]
+
+requires-python = ">=3.11"
+
+
+[project.optional-dependencies]
+torch = ["torch>=2.8.0"] 
+
+[tool.setuptools]
+package-dir = {"" = "src"}
+packages = ["multimodalrouter", "multimodalrouter.graph", "multimodalrouter.router", "multimodalrouter.utils"]
+
+[project.scripts]
+multiModalRouter-build = "multimodalrouter.router.build:main"
+multiModalRouter-route = "multimodalrouter.router.route:main"
+

multimodalrouter-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/PKG-INFO

@@ -0,0 +1,115 @@
+Metadata-Version: 2.4
+Name: multimodalrouter
+Version: 0.1.0
+Summary: A graph-based routing library for dynamic routing.
+Author-email: Tobias Karusseit <karusseittobi@gmail.com>
+License: MIT License
+        
+        Copyright (c) 2025 Tobias Karusseit
+        
+        Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+        
+        The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+        
+        THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+        
+        
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE.md
+Requires-Dist: colorama>=0.4.6
+Requires-Dist: dill>=0.4.0
+Requires-Dist: filelock>=3.19.1
+Requires-Dist: fsspec>=2025.9.0
+Requires-Dist: Jinja2>=3.1.6
+Requires-Dist: MarkupSafe>=3.0.2
+Requires-Dist: mpmath>=1.3.0
+Requires-Dist: networkx>=3.5
+Requires-Dist: numpy>=2.3.3
+Requires-Dist: pandas>=2.3.2
+Requires-Dist: parquet>=1.3.1
+Requires-Dist: ply>=3.11
+Requires-Dist: pyarrow>=21.0.0
+Requires-Dist: python-dateutil>=2.9.0.post0
+Requires-Dist: pytz>=2025.2
+Requires-Dist: setuptools>=80.9.0
+Requires-Dist: six>=1.17.0
+Requires-Dist: sympy>=1.14.0
+Requires-Dist: thriftpy2>=0.5.3
+Requires-Dist: tqdm>=4.67.1
+Requires-Dist: typing_extensions>=4.15.0
+Requires-Dist: tzdata>=2025.2
+Provides-Extra: torch
+Requires-Dist: torch>=2.8.0; extra == "torch"
+Dynamic: license-file
+
+# Multi Modal Router
+
+The Multi Modal Router is a graph-based routing engine that allows you to build and query any hub-based network. It supports multiple transport modes like driving, flying, or shipping, and lets you optimize routes by distance, time, or custom metrics. It can be expanded to any n-dimensional space making it versatile in any coordinate space
+
+> NOTE: This project is a work in progress and features might be added and or changed
+
+# In depth Documentation
+
+[installation guide](./docs/installation.md)
+
+[graph module documentation](./docs/graph.md)
+
+[code examples](./docs/examples/demo.py)
+
+[command line interface documentation](./docs/cli.md)
+
+[utilities documentation](./docs/utils.md)
+
+
+# Features
+
+## Building Freedom / Unlimited Usecases
+
+The graph can be build from any data aslong as the required fields are present ([example](./docs/examples/demoData.csv)). Whether your data contains real world places or you are working in a more abstract spaces with special coordinates and distance metrics the graph will behave the same (with minor limitations due to dynamic distance calculation, but not a problem when distances are already precomputed. [solutions](./docs/graph.md#advanced-options)).
+
+#### Example Usecases
+
+- real world flight router
+    - uses data with real flight data and actuall airport coordinates
+    - builds a graph with `airport` [Hubs](./docs/graph.md#hub)
+    - connects `airports` based on flight routes
+    - `finds` the `shortest flights` or `multi leg routes` to get from `A` to `B`
+    - simple example implementation [here](./docs/examples/flightRouter/main.py)
+
+- social relation ship graph
+    - uses user data like a social network where users are connected through others via a group of other users
+    - builds a graph with `users` as Hubs
+    - connects users based on know interactions or any other connection meric
+    - `finds` users that are likely to `share`; `interests`, `friends`, `a social circle`, etc.
+
+- coordinate based game AI and pathfinding
+    - uses a predefined path network (e.g. a simple maze)
+    - `builds` the garph representation of the network
+    - `finds` the shortest way to get from any point `A` to any other point `B` in the network
+    - you can checkout a simple example implementation for a maze pathfinder [here](./docs/examples/mazePathfinder/main.py)
+
+![example from the maze solver](./docs/solvedMaze1.png)
+
+## Important considerations for your usecase
+
+Depending on your usecase and datasets some features may not be usable see solutions below
+
+### potential problems based on use case
+
+**Please check your data for the following**
+
+| distance present | coordinate format | unusable features | special considerations |
+|------------------|-------------------|-------------------|------------------------|
+|      YES         |      degrees      |      None         |        None|
+|      YES|not degrees| runtime distance calculations| set [drivingEnabled = False](./docs/graph.md#args) or do [this](./docs/graph.md#swap-distance-method)|
+| NO | degrees | None | distances must be calculated when [preprocessing](./src/multimodalrouter/utils/preprocessor.py) |
+| NO | not degrees | **ALL** | **U cant build the graph with neither distances or supported coordinates!** [**solution**](./docs/graph.md#swap-distance-method)
+
+[**example dataframe with the required fields**](./docs/examples/demoData.csv)
+
+### License
+
+[see here](./LICENSE.md)
+
+

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/SOURCES.txt

@@ -0,0 +1,25 @@
+LICENSE.md
+MANIFEST.in
+README.md
+pyproject.toml
+src/multiModalRouter.egg-info/PKG-INFO
+src/multiModalRouter.egg-info/SOURCES.txt
+src/multiModalRouter.egg-info/dependency_links.txt
+src/multiModalRouter.egg-info/entry_points.txt
+src/multiModalRouter.egg-info/requires.txt
+src/multiModalRouter.egg-info/top_level.txt
+src/multimodalrouter/__init__.py
+src/multimodalrouter.egg-info/PKG-INFO
+src/multimodalrouter.egg-info/SOURCES.txt
+src/multimodalrouter.egg-info/dependency_links.txt
+src/multimodalrouter.egg-info/entry_points.txt
+src/multimodalrouter.egg-info/requires.txt
+src/multimodalrouter.egg-info/top_level.txt
+src/multimodalrouter/graph/__init__.py
+src/multimodalrouter/graph/dataclasses.py
+src/multimodalrouter/graph/graph.py
+src/multimodalrouter/router/__init__.py
+src/multimodalrouter/router/build.py
+src/multimodalrouter/router/route.py
+src/multimodalrouter/utils/__init__.py
+src/multimodalrouter/utils/preprocessor.py

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/entry_points.txt

@@ -0,0 +1,3 @@
+[console_scripts]
+multiModalRouter-build = multimodalrouter.router.build:main
+multiModalRouter-route = multimodalrouter.router.route:main

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/requires.txt

@@ -0,0 +1,25 @@
+colorama>=0.4.6
+dill>=0.4.0
+filelock>=3.19.1
+fsspec>=2025.9.0
+Jinja2>=3.1.6
+MarkupSafe>=3.0.2
+mpmath>=1.3.0
+networkx>=3.5
+numpy>=2.3.3
+pandas>=2.3.2
+parquet>=1.3.1
+ply>=3.11
+pyarrow>=21.0.0
+python-dateutil>=2.9.0.post0
+pytz>=2025.2
+setuptools>=80.9.0
+six>=1.17.0
+sympy>=1.14.0
+thriftpy2>=0.5.3
+tqdm>=4.67.1
+typing_extensions>=4.15.0
+tzdata>=2025.2
+
+[torch]
+torch>=2.8.0

multimodalrouter-0.1.0/src/multiModalRouter.egg-info/top_level.txt

@@ -0,0 +1 @@
+multimodalrouter

multimodalrouter-0.1.0/src/multimodalrouter/__init__.py

@@ -0,0 +1,4 @@
+from .graph import RouteGraph, Hub, EdgeMetadata, OptimizationMetric, Route, VerboseRoute
+from .utils import preprocessor
+
+__all__ = ["RouteGraph", "Hub", "EdgeMetadata", "OptimizationMetric", "Route", "VerboseRoute", "preprocessor"]

multimodalrouter-0.1.0/src/multimodalrouter/graph/__init__.py

@@ -0,0 +1,2 @@
+from .graph import RouteGraph # noqa: F401
+from .dataclasses import Hub, EdgeMetadata, OptimizationMetric, Route, VerboseRoute # noqa: F401

multimodalrouter-0.1.0/src/multimodalrouter/graph/dataclasses.py

@@ -0,0 +1,106 @@
+# dataclasses.py
+# Copyright (c) 2025 Tobias Karusseit
+# Licensed under the MIT License. See LICENSE file in the project root for full license information.
+
+
+from dataclasses import dataclass
+from enum import Enum
+
+
+class OptimizationMetric(Enum):
+    DISTANCE = "distance"
+
+
+class EdgeMetadata:
+    __slots__ = ['transportMode', 'metrics']
+
+    def __init__(self, transportMode: str = None, **metrics):
+        self.transportMode = transportMode
+        self.metrics = metrics  # e.g., {"distance": 12.3, "time": 15} NOTE distance is required by the graph
+
+    def getMetric(self, metric: OptimizationMetric | str):
+        if isinstance(metric, str):
+            value = self.metrics.get(metric)
+            if value is None:
+                raise KeyError(f"Metric '{metric}' not found in EdgeMetadata")
+            return value
+
+        value = self.metrics.get(metric.value)
+        if value is None:
+            raise KeyError(f"Metric '{metric.value}' not found in EdgeMetadata")
+        return value
+
+    def copy(self):
+        return EdgeMetadata(transportMode=self.transportMode, **self.metrics)
+
+    @property
+    def allMetrics(self):
+        return self.metrics.copy()
+
+    def __str__(self):
+        return f"transportMode={self.transportMode}, metrics={self.metrics}"
+
+
+class Hub:
+    """Base hub class - using regular class instead of dataclass for __slots__ compatibility"""
+    __slots__ = ['coords', 'id', 'outgoing', 'hubType']
+
+    def __init__(self, coords: list[float], id: str, hubType: str):
+        self.coords: list[float] = coords
+        self.id = id
+        self.hubType = hubType
+        self.outgoing = {}
+
+    def addOutgoing(self, mode: str, dest_id: str, metrics: EdgeMetadata):
+        if mode not in self.outgoing:
+            self.outgoing[mode] = {}
+        self.outgoing[mode][dest_id] = metrics
+
+    def getMetrics(self, mode: str, dest_id: str) -> EdgeMetadata:
+        return self.outgoing.get(mode, {}).get(dest_id, None)
+
+    def getMetric(self, mode: str, dest_id: str, metric: str) -> float:
+        connection = self.outgoing.get(mode, {}).get(dest_id)
+        return getattr(connection, metric, None) if connection else None
+
+    def __hash__(self):
+        return hash((self.hubType, self.id))
+
+
+@dataclass
+class Route:
+    """Route class can use dataclass since it doesn't need __slots__"""
+    path: list[tuple[str, str]]
+    totalMetrics: EdgeMetadata
+    optimizedMetric: OptimizationMetric
+
+    @property
+    def optimizedValue(self):
+        return self.totalMetrics.getMetric(self.optimizedMetric)
+
+    @property
+    def flatPath(self, toStr=True):
+        """Flatten the path into a list of hub IDs"""
+        if not self.path:
+            return []
+        # get all source hubs plus the final destination
+        path = [edge for edge in self.path]
+        if not toStr:
+            return path
+        pathStr = ""
+        for i, edge in enumerate(path):
+            if i == 0:
+                pathStr += f"Start: {edge[0]}"
+                continue
+
+            if len(edge) > 2 and isinstance(edge[2], EdgeMetadata):
+                pathStr += f"\n\tEdge: ({str(edge[2])})\n-> {edge[0]}"
+            else:
+                pathStr += f"{edge[0]} -> {edge[1]}"
+        return pathStr
+
+
+@dataclass
+class VerboseRoute(Route):
+    """Uses base Route class but adds additional info to hold the edge metadata for every leg"""
+    path: list[tuple[str, str, EdgeMetadata]]