GitHub - childhood/dsLib: An algorithm library with core data-sttructures and common algortihm implementations on those data structures

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 56 Commits
COPYING		COPYING
ChangeLog		ChangeLog
Makefile		Makefile
README		README
btree.c		btree.c
btree.h		btree.h
build_graphs.sh		build_graphs.sh
common.h		common.h
config.h		config.h
doxygen.config		doxygen.config
ds.c		ds.c
ds_err.h		ds_err.h
ds_types.h		ds_types.h
graph.c		graph.c
graph.h		graph.h
graph_ops.c		graph_ops.c
graph_ops.h		graph_ops.h
heap.c		heap.c
heap.h		heap.h
ll.c		ll.c
ll.h		ll.h
queue.c		queue.c
queue.h		queue.h
sets.c		sets.c
sort.c		sort.c
sort.h		sort.h
stack.c		stack.c
stack.h		stack.h
tc.c		tc.c
tc_btree.c		tc_btree.c
tc_graph.c		tc_graph.c
tc_graph.h		tc_graph.h
tc_heap.c		tc_heap.c
tc_heap.h		tc_heap.h
tc_ll.c		tc_ll.c
tc_sort.c		tc_sort.c
utils.c		utils.c
utils.h		utils.h

Repository files navigation

dsLib
-----
Copyright (c) 2010 - 2011, Gaurav Mathur <narainmg@gmail.com> 
All Rights Reserved.

dsLib is a library of the commonly used data structure and
algorithm. The idea is to provide rich set of APIs to these data
structures which could be used by applications by linking to this
library. It's designed with space and time performace complexity in
mind to be as efficient as possible. It will not solve all data
structure design and performance needs all of the time but some needs
some of the time. There are a rich set of test cases included that
illustrate how the data structure APIs can be used.

This work is still under active development so the paragraph above
should read more like a mission statement for the time being.

--
Last updated: 29th Sep 2011