mincost Files

Brought to you by: ftavakoli

The interactive file manager requires Javascript. Please enable it or use sftp or scp.
You may still browse the files here.

Name	Modified	Size
project	2016-12-05
mincost-fatemeh tavakoli.zip	2016-12-05	130.3 kB
Totals: 2 Items		130.3 kB

Other Useful Business Software

MongoDB Atlas runs apps anywhere

Deploy in 115+ regions with the modern database for every enterprise.

MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.

Start Free

Veeam Data Platform v13.1

Move workloads across hypervisors and clouds with no vendor lock-in. Try VDP free today.

Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.

Try Now

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Recommended Projects

Dijkstra shortest path algorithm
Simple Dijkstra shortest path implementation - for learning and teaching
knight-path
The knight-path program is used to find shortest path of a knight chess piece between two chess board positions.
GPS
A GPS simulator created in java. It contains a graphical interface and the shortest path will be found using Dijkstra algorithm
GnuPinch
GnuPinch is a pinch analysis and supertargeting tool. GnuPinch can calculate heat exchanger networks (HEN) with minimum energy requeriments and minimum cost. It also can calculate other parameters of the pinch analysis of a chemical process.
Grapho
A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).