Code Monkey home page Code Monkey logo

shortest-path-via-specified-nodes's Introduction

The shortest path via specified nodes

Created by Ya-Nan Chen at IAIR, Xi’an Jiaotong University.

介绍

华为软件精英挑战赛西北赛区32强,赛题“寻路”,找到经过必经节点的最短路径。 该代码为复赛代码,初赛稍有不同,按照要求修改即可。 算法思路参考了论文:Protected shortest path visiting specified nodes。

运行环境配置

不需要任何第3方依赖库,可以直接在Visual studio中运行。 route.cpp 为函数功能实现总入口。

Contact

个人主页: https://chenyncv.github.io/

shortest-path-via-specified-nodes's People

Contributors

chenyncv avatar

Stargazers

 avatar

Watchers

 avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.