A technical communication website explaining route optimization through Dijkstra’s Algorithm using both a technical description and an instructional set.
The project separates system-level explanation from task-based instruction.
This project is divided into two parts:
- Technical Description: Explains how route optimization works in navigation systems.
- Instructional Set: Guides users through manually applying Dijkstra’s Algorithm to a weighted graph.
The technical description focuses on how the system works. The instructional set focuses on how a user performs the process.
Explains how road networks can be represented as weighted graphs, where intersections are nodes, roads are edges, and travel costs are weights.
This section focuses on system components, relationships, and shortest-path computation.
Provides a step-by-step guide for manually finding the shortest path in a weighted graph.
This section focuses on user actions, required materials, constraints, checks, and common mistakes.
- Technical description page
- Step-by-step instructional guide
- Interactive Dijkstra’s Algorithm visualization
- Responsive web layout
- Clear separation between conceptual explanation and procedural instruction
- HTML: Page structure and content organization
- CSS: Styling, layout, and visual hierarchy
- JavaScript: Interactive behavior and algorithm visualization
index.html— Technical description pageinstructions.html— Instructional set pagemain.css— Shared styling and layout*.js— Interactive behavior and visualization logic