Dr. Hamidi has decided to make the first ACM/ICPC club introduction session, so the members could become more familiar with each other and with the club programs.
Thus the members are invited to participate in this session according to the following time table.
The first session will be established on Wed 11 Ord 1387 2-3 PM and the place will be informed later.
Monday, April 28, 2008
Tuesday, April 15, 2008
Dijkstra Shortest Path Algorithm
hi,
i was just browsing the web and found an interesting algorithm which implements the Dijkstra (Dykstra) algorithm for finding the shortest path in a graph using the C++ language.
useful for studying but would not be the best could be implemented.
i was just browsing the web and found an interesting algorithm which implements the Dijkstra (Dykstra) algorithm for finding the shortest path in a graph using the C++ language.
useful for studying but would not be the best could be implemented.
download and study the code here ;)
from: ds for beginners
from: ds for beginners
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree. This algorithm is often used in routing.
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.
full description of the algorithm hereFor a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.
Sunday, April 13, 2008
Advanced Programmers!
hi,
dr mahdavi has uploaded the translated files (en&fa) into the lms and now it's available for downloading.
just login to the lms and open the ap course, so you see allre there ;)
dr mahdavi has uploaded the translated files (en&fa) into the lms and now it's available for downloading.
just login to the lms and open the ap course, so you see allre there ;)
Thursday, April 10, 2008
Monday, April 7, 2008
INOI 2008 Online Contests
Fwd: Invitation to INOI 2008 online contests
------------------------------------------------------------
Dear all
We are glad to announce that we are hosting a series of Internet online contests with problems from Iranian National Olympiad in Informatics (INOI) 2008.
These contests are used in Iran to select members of the IOI team.
There will be 5 contests in one week. Each contest has 3 tasks and will be 5 hours long.
The contests are primarily intended for high school contestants, but are open to all interested!
Visit http://contest.inoi.ir for more information and registration.
Online contests last for 24 hours (to be convenient for people all around the world), although we encourage all participants to choose one five hours long period for solving the tasks.
They will be held on April, 11th through 17th.
The exact program of online competitions can be found at http://contest.inoi.ir/user.phtml?op=msg&m=info&id=5447&c=200
Regards,
INOI 2008 committee
------------------------------------------------------------
Dear all
We are glad to announce that we are hosting a series of Internet online contests with problems from Iranian National Olympiad in Informatics (INOI) 2008.
These contests are used in Iran to select members of the IOI team.
There will be 5 contests in one week. Each contest has 3 tasks and will be 5 hours long.
The contests are primarily intended for high school contestants, but are open to all interested!
Visit http://contest.inoi.ir for more information and registration.
Online contests last for 24 hours (to be convenient for people all around the world), although we encourage all participants to choose one five hours long period for solving the tasks.
They will be held on April, 11th through 17th.
The exact program of online competitions can be found at http://contest.inoi.ir/user.phtml?op=msg&m=info&id=5447&c=200
Regards,
INOI 2008 committee
Subscribe to:
Posts (Atom)
