All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.

Project Activity

See All Activity >

Categories

Algorithms

License

Apache Software License

Follow APSP using Iterative Mapreduce (Twister)

APSP using Iterative Mapreduce (Twister) Web Site

Other Useful Business Software
Outgrown Windows Task Scheduler? Icon
Outgrown Windows Task Scheduler?

Free diagnostic identifies where your workflow is breaking down—with instant analysis of your scheduling environment.

Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
Download Free Tool
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of APSP using Iterative Mapreduce (Twister)!

Additional Project Details

Intended Audience

Science/Research

Programming Language

Java

Related Categories

Java Algorithms

Registered

2010-09-06