Skip to content
This repository has been archived by the owner on Aug 7, 2024. It is now read-only.

A graph modeling problem. Solution developed in .NET C# code and WebApi

Notifications You must be signed in to change notification settings

marcusvnac/CarriageServices

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

CarriageServices

Background

Lannister Carriage Services provides commute and transportation services to a number of towns in the great land of Westeros. Because of economical reasons and to avoid ambushes, most routes are "oneway". That is, a route from Volantis to King's Landing does not imply in a route from King's Landing to Volantis. In fact, even if both of these routes do happen to exist, they are distinct and are not necessarily the same distance!

Story Phrase

As a Lannister Carriage Services customer I want to know the available routes between towns as well as their distances so I can choose the best route for my travel. Business Narrative / Scenario The purpose of this application is to help Lannister Carriage Services provide its customers information about the routes. In particular, you will compute the distance along a certain route, the number of different routes between two towns, and the shortest route between two towns.

This implementation had been made with .NET C# and RESTful webservice API

About

A graph modeling problem. Solution developed in .NET C# code and WebApi

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published