alepharchives / erl_dijk Goto Github PK
View Code? Open in Web Editor NEWThis project forked from saketkunwar/erl_dijk
shortest route dijkstra algorithm implemented in erlang
This project forked from saketkunwar/erl_dijk
shortest route dijkstra algorithm implemented in erlang
# Copyright 2009 saket kunwar # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. This is a depth first graph traversal and shortest path search implentation based on dijkstra's algorithm.The nodes were created using erlangs digraph but edges in both direction were created to make it undirectional or bi-directional.There is an API for shortest path search between two vertex and between all the vertex of the graph. The code provides hard coded examples of digraph creation and shortest path search. THough there is also a implementation of a transactional graph server and vertex_server so that vertex can been added without the destruction of the graph state and recompilation. i.e new vertex and edges can be added to the graph from the erlang shell with the graph_server %%usage example dijk:start(). ListofVertex=graph_server:make_graph(). %%initialize some graph {Source,[]}=graph_server:getvertex(N,ListofVertex). %%where N is the vertex num {Dest,[]}=graph_server:getvertex(N,ListofVertex). %%where N is the vertex num vertex_server:add(Vertex). V1=graph_server:addvertex(). V2=graph_server:addvertex(). graph_server:createedge(V1,V2,2). graph_server:traverse(Source,Dest). Each vertex also spawns it's own process.THere is a functionality for forwarding a message from one vertex process to another i.e from source vertex to destination vertex on the shortest path install -------- goto source directory src and type make all bin files will be stored in directory ebin To-do need to get the vertex label for easier use from the shell Author saket kunwar email me for comments: [email protected] Feb 17,2009
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.