Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version
Go to top

Dijkstra:Shortest Route Calculation - Object Oriented

, 3 Jan 2008
Calculation of the shortest path between x points
shortestpath_demo.zip
Gui.exe
RouteEngine.dll
shortestpath_src.zip
Gui
bin
Debug
Gui.exe
Gui.pdb
Gui.vshost.exe
RouteEngine.dll
RouteEngine.pdb
Properties
Settings.settings
RouteCalc
bin
Debug
RouteCalc.exe
RouteCalc.vshost.exe
RouteCalc.vshost.exe.manifest
Properties
RouteEngine
bin
Debug
RouteEngine.dll
RouteEngine.pdb
Properties
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace RouteEngine
{
    public class Route
    {
        int _cost;
        List<Connection> _connections;
        string _identifier;

        public Route(string _identifier)
        {
            _cost = int.MaxValue;
            _connections = new List<Connection>();
            this._identifier = _identifier;
        }


        public List<Connection> Connections
        {
            get { return _connections; }
            set { _connections = value; }
        }
        public int Cost
        {
            get { return _cost; }
            set { _cost = value; }
        }

        public override string ToString()
        {
            return "Id:" + _identifier + " Cost:" + Cost;
        }
    }
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

No Biography provided

| Advertise | Privacy | Mobile
Web02 | 2.8.140916.1 | Last Updated 3 Jan 2008
Article Copyright 2008 by Michael Demeersseman
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid