Home
Blogs
Forums
Photos
Downloads
Welcome to Geeks Portal
Sign in
|
Join
|
Help
in
Current Tags
norman
Papers
(Entire Site)
Browse Folders
Presentations
Slides
Code
Images
Standards
normslides
INDC Articles
Software Development
Papers
norman
Project Otak
CTP E-Books
Books
eBook
Visual Studio Express Books
DNN
sample codes
Installer
Training Kit
Trial Software
PatternAndPractices
Update
SQL Server 2008 Express
Internet Explorer 8
Visual Studio 2008 Express
Posters
PDF
JPEG
.NET Developer Idol
.NET Developer Idol 2008 Tutorial
Tools and IDE
Source Codes
C++ and Win32
MIC-UI Trainings
norman: Browse by Tags
All Tags
»
Greedy
Algorithm
Dijkstra
Graph
Kruskal
Minimum Spanning Tree
Prim
Shortest Path
Page 1 of 1 (2 items)
Files in this Folder
File
Date Added
Downloads
Explaining Dijkstra Algorithm - Greedy Technique to solve Shortest Path Problem
Dijkstra’s algorithm is a well known algorithm to solve the single-source shortest paths problem. This paper explains the algorithm by focusing on the algorithm design technique used, which is the Greedy...
04-26-2008
34
Download
File Size 43.1kB
Greedy Algorithms to solve Minimum Spanning Trees Problem
Minimum Spanning Tree problem is an example of Optimization problem. This kind of problem can be solved with technique such as the Greedy technique. This paper explains two algorithms to solve this problem...
04-26-2008
23
Download
File Size 45.5kB
Page 1 of 1 (2 items)
Copyright ©
INDC
, 2006. All rights reserved.