https://github.com/cybersecurity-dev/data-structures-in-fsharp

Data Structures in F#
https://github.com/cybersecurity-dev/data-structures-in-fsharp

data-structure data-structure-in-fsharp data-structures data-structures-in-fsharp

Last synced: 28 days ago
JSON representation

Data Structures in F#

• Host: GitHub
• URL: https://github.com/cybersecurity-dev/data-structures-in-fsharp
• Owner: cybersecurity-dev
• License: mit
• Created: 2025-08-15T11:01:09.000Z (3 months ago)
• Default Branch: main
• Last Pushed: 2025-08-15T11:15:50.000Z (3 months ago)
• Last Synced: 2025-08-15T13:08:25.663Z (3 months ago)
• Topics: data-structure, data-structure-in-fsharp, data-structures, data-structures-in-fsharp
• Homepage:
• Size: 4.88 KB
• Stars: 1
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# [Data Structures](https://en.wikipedia.org/wiki/Data_structure) in [F#](https://github.com/cybersecurity-dev/awesome-fsharp-programming-language)

[![Reddit](https://img.shields.io/badge/Reddit-FF4500?style=for-the-badge&logo=reddit&logoColor=white)](https://www.reddit.com/r/datastructures/) 



    

     

    

     

    

    



## Data structures

* [List](https://en.wikipedia.org/wiki/List_(abstract_data_type))

* [Set](https://en.wikipedia.org/wiki/Set_(abstract_data_type))

* [Multiset](https://en.wikipedia.org/wiki/Multiset)

* [Map](https://en.wikipedia.org/wiki/Associative_array)

* [Multimap](https://en.wikipedia.org/wiki/Multimap)

* [Graph](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))

* [Tree](https://en.wikipedia.org/wiki/Tree_(data_structure))

* [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))

* [Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))

* [Priority queue](https://en.wikipedia.org/wiki/Priority_queue)

* [Double-ended queue](https://en.wikipedia.org/wiki/Double-ended_queue)

* [Double-ended priority queue](https://en.wikipedia.org/wiki/Double-ended_priority_queue)

---

| Data Structure | F# Implementation |

|----|:----:|

|[List](https://en.wikipedia.org/wiki/List_(abstract_data_type))|[source](#)|

|[Set](https://en.wikipedia.org/wiki/Set_(abstract_data_type))|[source](#)|

|[Multiset](https://en.wikipedia.org/wiki/Multiset)|[source](#)|

|[Map](https://en.wikipedia.org/wiki/Associative_array)|[source](#)|

|[Multimap](https://en.wikipedia.org/wiki/Multimap)|[source](#)|

|[Graph](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))|[source](#)|

|[Tree](https://en.wikipedia.org/wiki/Tree_(data_structure))|[source](#)|

|[Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))|[source](#)|

|[Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))|[source](#)|

|[Priority queue](https://en.wikipedia.org/wiki/Priority_queue)|[source](#)|

|[Double-ended queue](https://en.wikipedia.org/wiki/Double-ended_queue)|[source](#)|

|[Double-ended priority queue](https://en.wikipedia.org/wiki/Double-ended_priority_queue)|[source](#)|