Students can freely download the source code to modify and adopt. However, direct plagarism is not encouraged and we will not be responsible for any lost induced by the adoption.
You can download the implementation that suits your needs in the following link:
https://sourceforge.net/projects/dsas/files
The data structures available now:
- AVL Tree
- insert
- search
- remove
- Binary Tree
- insert
- search
- remove
- Graph
- Topological sort
- Dijkstra
- Kruskal
- Floyd-Warshall
- Linked List
- insert
- remove
This is still a small project but hopefully as time grows it would contain more and more implementations.
If you want to supply an implementation, please note:
- Only source code is accepted. Object code, binary code, pseudo-code or executables will be ignored.
- Please extract your implementation to a IDE independent format. I.e. only .h, .c, .cpp, .java (etc.) files but not the whole project / solution.
- Your implementation should be general enough to be used in different situations.
- Please email your code to dsasproj@gmail.com, and by this you consent the disclosure of your code on DSAS freely.
- We would address your name as author on request.
If you notice a bug, or having any suggestion, please email to dsasproj@gmail.com, or leave a comment~
