Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

undirected-graph-typed

Package Overview
Dependencies
Maintainers
1
Versions
172
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

undirected-graph-typed

Undirected Graph. Javascript & Typescript Data Structure.

  • 1.47.1
  • Source
  • npm
  • Socket score

Version published
Weekly downloads
139
decreased by-64.18%
Maintainers
1
Weekly downloads
 
Created
Source

NPM GitHub top language npm eslint npm package minimized gzipped size (select exports) npm bundle size npm

What

Brief

This is a standalone Undirected Graph data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete data-structure-typed package

How

install

npm

npm i undirected-graph-typed --save

yarn

yarn add undirected-graph-typed

methods

snippet

TS
JS

API docs & Examples

API Docs

Live Examples

Examples Repository

Data Structures

Data StructureUnit TestPerformance TestAPI DocumentationImplemented
Binary Tree Binary Tree
Binary Search Tree (BST)BST
AVL TreeAVLTree
Tree MultisetTreeMultimap
Segment TreeSegmentTree
Binary Indexed TreeBinaryIndexedTree
GraphAbstractGraph
Directed GraphDirectedGraph
Undirected GraphUndirectedGraph
Linked ListSinglyLinkedList
Singly Linked ListSinglyLinkedList
Doubly Linked ListDoublyLinkedList
QueueQueue
Object DequeObjectDeque
Array DequeArrayDeque
StackStack
Coordinate SetCoordinateSet
Coordinate MapCoordinateMap
HeapHeap
Priority QueuePriorityQueue
Max Priority QueueMaxPriorityQueue
Min Priority QueueMinPriorityQueue
TrieTrie

Why

Complexities

performance of Big O

Big O NotationTypeComputations for 10 elementsComputations for 100 elementsComputations for 1000 elements
O(1)Constant111
O(log N)Logarithmic369
O(N)Linear101001000
O(N log N)n log(n)306009000
O(N^2)Quadratic100100001000000
O(2^N)Exponential10241.26e+291.07e+301
O(N!)Factorial36288009.3e+1574.02e+2567

Data Structure Complexity

Data StructureAccessSearchInsertionDeletionComments
Array1nnn
Stacknn11
Queuenn11
Linked Listnn1n
Hash Table-nnnIn case of perfect hash function costs would be O(1)
Binary Search TreennnnIn case of balanced tree costs would be O(log(n))
B-Treelog(n)log(n)log(n)log(n)
Red-Black Treelog(n)log(n)log(n)log(n)
AVL Treelog(n)log(n)log(n)log(n)
Bloom Filter-11-False positives are possible while searching

Sorting Complexity

NameBestAverageWorstMemoryStableComments
Bubble sortnn2n21Yes
Insertion sortnn2n21Yes
Selection sortn2n2n21No
Heap sortn log(n)n log(n)n log(n)1No
Merge sortn log(n)n log(n)n log(n)nYes
Quick sortn log(n)n log(n)n2log(n)NoQuicksort is usually done in-place with O(log(n)) stack space
Shell sortn log(n)depends on gap sequencen (log(n))21No
Counting sortn + rn + rn + rn + rYesr - biggest number in array
Radix sortn * kn * kn * kn + kYesk - length of longest key

overview diagram

complexities

complexities of data structures

Keywords

FAQs

Package last updated on 22 Nov 2023

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc