Example : dijkstra journey model

### # Dijkstra Pathfinding Model

## Overview

This project demonstrates the Dijkstra algorithm for finding the shortest path . Each agent calculates the shortest path from a starting position to a goal position

The issue names no files, tests, or entry points. Start by reviewing existing examples in the repository to identify the expected model structure and run workflow. Done should be a runnable Dijkstra pathfinding example that matches the described starting-position and goal-position behavior.

Written by the indexing model from the issue text.