Search Results for "graph class"

GeoTools is an open source (LGPL) Java code library which provides standards compliant methods for the manipulation of geospatial data. GeoTools is an Open Source Geospatial Foundation project. The GeoTools library data structures are based on Open Geospatial Consortium (OGC) specifications.

OpenJUMP is a community driven fork of JUMP the "Java Unified Mapping Platform" GIS software. The original JUMP was developed by Vivid Solutions, released under GPL2 in 2003 and discontinued in 2006. During 2004 already some enthusiastic developers joined together to enhance further the features of JUMP. They launched an independent development branch called OpenJUMP. The name gives credit to the original JUMP development, and at the same time describes the objectives of this project to...

Croizat is a free, user-friendly, cross-platform desktop software package which biologists can use to integrate and analyze spatial data on species or other taxa and to explore geographical patterns in diversity under a panbiogeographic and graph-theoretic approach.

Desktop application for browsing and visualizing GPS files on your local storage or on network. * Quickly navigate your GPS files using embedded file/track/metadata browser * Works with gpx, kml, and csv files * Show overview map of all tracks in directory * Filter tracks in browser based on metadata, location, and path * Color code track overview based on metadata, e.g., overall distance, start time * Simultaneously view one or more tracks on map while graphing detailed metadata...

Syntax2D is a suite of tools for urban and architectural spatial analysis developed at the University of Michigan. It includes space syntax measures of isovists, axial maps, and visibility graphs, with some newer features such as path-based measures. New versions are released here.

A project to create of open source routing engine for navigation and possibly other graph analysis. Our goal is to build a commercial grade routing engine capable of find routes through 25-30 million node networks in 1 second ball park times.