Functions — github.com/OpenGenus/quark

CodeHub MCPcopy Create free account

hub / github.com/OpenGenus/quark / functions

Functions5,611 in github.com/OpenGenus/quark

⨍ Functions 5,611◇ Types & classes 781

↓ 7 callersFunctionweeksInYear

(year, dow, doy)

code/js/moment.js:1225

↓ 6 callersMethodInsert

(key interface{})

code/code/data_structures/src/list/doubly_linked_list/doubly_linked_list.go:20

↓ 6 callersFunctionLGraph_addUEdge

* Add a new undirected edge to the graph, connecting id1 & id2. * * @graph The graph. * @id1 ID of a node. * @id2 ID of a node. * * @return 0 on

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:206

↓ 6 callersMethodNext

code/code/data_structures/src/list/singly_linked_list/singly_linked_list_with_classes.cpp:20

↓ 6 callersMethodPush

code/code/data_structures/src/queue/reverse_queue/reverse_queue.go:22

↓ 6 callersMethodSort

code/code/sorting/src/quick_sort/quick_sort.cs:56

↓ 6 callersMethodUnion

Union connects p and q by finding their roots and comparing their respective size arrays to keep the tree flat

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.go:32

↓ 6 callersMethodUnion

Connect vertices `a` and `b`.

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.cpp:36

↓ 6 callersFunctiona

code/js/popper.min.js:4

↓ 6 callersMethodaddEdge

code/code/graph_algorithms/src/cycle_directed_graph/cycle_directed_graph.cpp:24

↓ 6 callersMethodaddEdge

code/code/graph_algorithms/src/transitive_closure_graph/transitive_closure_graph.py:19

↓ 6 callersMethodaddEdge

code/code/graph_algorithms/src/breadth_first_search/Bfs.java:21

↓ 6 callersMethodaddEdge

(self, node1, node2)

code/code/graph_algorithms/src/breadth_first_search/breadth_first_search.py:21

↓ 6 callersMethodaddEdge

code/code/graph_algorithms/src/strongly_connected_components/strongly_connected_components.py:16

↓ 6 callersMethodaddEdge

Function to add an edge into the Graph

code/code/graph_algorithms/src/depth_first_search/Dfs.kt:11

↓ 6 callersMethodaddEdge

(self, node1, node2)

code/code/graph_algorithms/src/depth_first_search/depth_first_search.py:9

↓ 6 callersMethodaddEdge

code/code/graph_algorithms/src/depth_first_search/Dfs.java:25

↓ 6 callersMethodaddEdge

code/code/sorting/src/topological_sort/topological_sort.cpp:34

↓ 6 callersMethodaddValue

(char character, int valueToShiftBy)

code/code/cryptography/src/caesar_cipher/CaesarCipher.cs:15

↓ 6 callersMethodadd_edge

code/code/graph_algorithms/src/graph_coloring/graph_color_greedy.py:11

↓ 6 callersFunctionat

code/js/jquery.js:4

↓ 6 callersFunctionbinary_insert

This recursive function will insert the objects into the tree

code/code/sorting/src/tree_sort/tree_sort.py:13

↓ 6 callersFunctionbtree_ins

code/code/data_structures/src/tree/b_tree/b_tree/b_tree_C/btree.c:121

↓ 6 callersFunctioncopyRandomPartContainerToLists

code/code/data_structures/test/list/test_list.cpp:62

↓ 6 callersFunctioncreateLGraph

* Creates a new graph with adjacency-list representation. * * @n Number of nodes. * @graph The struct that will hold the graph. * * @return 0 on

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:45

↓ 6 callersFunctioncreate_node

code/code/data_structures/src/tree/binary_tree/binary_tree/make_mirror_tree/make_mirror_tree.c:16

↓ 6 callersFunctiondefaults

code/js/moment.js:2008

↓ 6 callersMethoddequeue

code/code/data_structures/src/queue/queue/queue.rb:13

↓ 6 callersMethoddisplayGraph

(Map<Integer,List<Edge>> graph, int n)

code/code/graph_algorithms/src/bipartite_checking/BipartiteGraphCheckAdjacencyList.java:214

↓ 6 callersFunctione

code/js/bricklayer.min.js:1

↓ 6 callersMethodempty?

code/code/data_structures/src/stack/stack/stack.rb:17

↓ 6 callersFunctionfill

code/code/sorting/test/test_sort.py:39

↓ 6 callersFunctionfind

A utility function to find set of an element i (uses path compression technique)

code/code/randomized_algorithms/src/karger_minimum_cut_algorithm/karger_minimum_cut_algorithm.cpp:109

↓ 6 callersMethodfind

Find a value from the set. Returns true if the set contained the specified element. */

code/code/data_structures/src/hashs/hash_table/hash_table.cpp:101

↓ 6 callersFunctionfreeLGraph

* Frees the given graph. * * @graph The graph to free. */

code/code/graph_algorithms/src/adjacency_lists_graph_representation/adjacency_lists_in_C/lgraph_struct.c:69

↓ 6 callersFunctionget

code/code/data_structures/src/queue/reverse_queue/reverse_queue.py:40

↓ 6 callersMethodgetBalance

code/code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.java:63

↓ 6 callersFunctiongetLocale

code/js/moment.js:1950

↓ 6 callersMethodgetNextNode

code/code/data_structures/src/list/singly_linked_list/singly_linked_list.cs:36

↓ 6 callersMethodget_next

code/code/data_structures/src/list/singly_linked_list/singly_linked_list.py:10

↓ 6 callersMethodgetnodeAt

code/code/data_structures/src/list/singly_linked_list/operations/unclassified/LinkedList.java:103

↓ 6 callersMethodhasNext

code/code/data_structures/src/bag/bag.java:84

↓ 6 callersMethodhash

Hashes the element(byte buffer) to an int @param buffer The byte buffer of the element to be hashed @return The hashed number

code/code/data_structures/src/hashs/bloom_filter/bloom_filter.java:287

↓ 6 callersFunctioninsert

code/code/data_structures/src/tree/multiway_tree/van_emde_boas_tree/van_emde_boas.cpp:29

↓ 6 callersMethodisEmpty

code/code/data_structures/src/bag/bag.py:32

↓ 6 callersFunctionisSubsetSum

code/code/dynamic_programming/src/subset_sum/subset_sum.cpp:16

↓ 6 callersFunctionl

code/js/jquery.js:5

↓ 6 callersMethodleftRotate

code/code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.java:48

↓ 6 callersFunctionlogError

code/js/moment-timezone-with-data.js:474

↓ 6 callersFunctionmakeGetSet

(unit, keepTime)

code/js/moment.js:798

↓ 6 callersFunctionmax

* Expect Output The length of LCS of ABCDEFGHIJKLMNOPQRABCEDG adn DEFNMJABCDEG is 9 */

code/code/dynamic_programming/src/longest_common_subsequence/longestCommonSubsequence.go:12

↓ 6 callersFunctionmedian

Calculates the median of a list of numbers. import median from statistics in python 3.4 and above.

code/code/dynamic_programming/src/Array_Median/median.py:7

↓ 6 callersFunctionmin

A utility function to return minimum of two integers

code/code/dynamic_programming/src/binomial_coefficient/binomial_coefficient.c:10

↓ 6 callersMethodpop

code/code/data_structures/src/stack/reverse_stack/reverse_stack.py:19

↓ 6 callersFunctionprint

code/code/data_structures/src/list/singly_linked_list/operations/sort/bubble_sort.cpp:18

↓ 6 callersFunctionprint_tree

code/code/data_structures/test/tree/multiway_tree/red_black_tree/test_red_black.c:65

↓ 6 callersMethodpush

code/code/data_structures/src/stack/sort_stack/sort_stack.py:12

↓ 6 callersMethodpush

code/code/data_structures/src/queue/circular_buffer/circular_buffer.cpp:31

↓ 6 callersMethodput

code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.kt:91

↓ 6 callersMethodrestore

code/code/compression/src/lossless_compression/huffman/huffman.cpp:370

↓ 6 callersMethodrightRotate

code/code/data_structures/src/tree/binary_tree/avl_tree/avl_tree.java:33

↓ 6 callersMethodroot

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.py:10

↓ 6 callersMethodsearch

code/code/data_structures/src/tree/binary_tree/binary_tree/tree/tree.py:118

↓ 6 callersMethodsetNext

sets the current object to the next node in the linked list

code/code/data_structures/src/list/singly_linked_list/singly_linked_list.cs:56

↓ 6 callersMethodsplay

code/code/data_structures/src/tree/multiway_tree/splay_tree/splay_tree.go:17

↓ 6 callersMethodstart

(root, left, right)

code/code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_sum.rb:11

↓ 6 callersMethodstringToBinary

code/code/compression/src/lossless_compression/huffman/huffman.cpp:460

↓ 6 callersMethodswap

(int fpos, int spos)

code/code/data_structures/src/tree/heap/min_heap/min_heap.java:82

↓ 6 callersMethodtoString

code/code/data_structures/src/stack/abstract_stack/cpp/arrayStack/ArrayStack.h:137

↓ 6 callersMethodunion

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.java:24

↓ 6 callersMethodvalue

code/code/data_structures/src/list/xor_linked_list/xor_linked_list.cpp:53

↓ 5 callersMethodBFS

code/code/data_structures/src/tree/heap/binomial_heap/binomial_heap.cpp:91

↓ 5 callersMethodContains

code/code/data_structures/src/hashs/bloom_filter/bloom_filter.cpp:23

↓ 5 callersMethodRoot

Root or Find traverses each parent element while compressing the levels to find the root element of p If we attempt to access an element outside the a

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.go:48

↓ 5 callersFunctionT

code/js/popper.min.js:4

↓ 5 callersMethodaddEdge

code/code/graph_algorithms/src/eulerian_path/eulerian.java:24

↓ 5 callersMethodaddEdge

code/code/graph_algorithms/src/strongly_connected_components/strongly_connected_components.cpp:65

↓ 5 callersFunctionaddWeekParseToken

(token, callback)

code/js/moment.js:709

↓ 5 callersFunctionaddbw

code/code/cryptography/src/huffman_encoding/huffman_encoding.c:56

↓ 5 callersFunctionaddl

code/code/cryptography/src/huffman_encoding/huffman_encoding.c:41

↓ 5 callersFunctioncheckPangram

code/code/string_algorithms/src/pangram_checker/pangram-checker.js:5

↓ 5 callersFunctioncnt

code/code/data_structures/src/tree/space_partitioning_tree/segment_tree/segment_tree_kth_statistics_on_segment.cpp:25

↓ 5 callersFunctioncombine

(low: number[], high: number[])

code/code/sorting/src/merge_sort/merge_sort.ts:17

↓ 5 callersFunctioncreate_node

Function to create new node

code/code/mathematical_algorithms/src/add_polynomials/add_polynomials.c:15

↓ 5 callersFunctiondaysInYear

code/js/moment.js:776

↓ 5 callersFunctiondecypher

(ct, ky, process=False)

code/code/cryptography/src/aes_128/AES_128.py:280

↓ 5 callersMethoddisplay

void linkedlist::display(node *head)

code/code/data_structures/src/list/singly_linked_list/operations/unclassified/linked_List_Operations.cpp:148

↓ 5 callersMethoddist

(double x1, double y1, double x2, double y2)

code/code/cellular_automaton/src/genetic_algorithm/genetic_algorithm.java:138

↓ 5 callersMethodenqueue

code/code/data_structures/src/queue/queue_using_linked_list/queue_using_linked_list.rb:12

↓ 5 callersMethodenqueue

code/code/data_structures/src/queue/queue_using_linked_list/queue_using_linked_list.cpp:57

↓ 5 callersFunctionevaluation

code/code/artificial_intelligence/src/TSP/salesman.cpp:31

↓ 5 callersFunctionfactorial

function to find factorial of given number

code/code/mathematical_algorithms/src/factorial/factorial.c:4

↓ 5 callersFunctionfast_power

(base,exponent int)

code/code/mathematical_algorithms/src/exponentiation_power/exponentiation_by_squaring/exponentiation_by_squaring.go:9

↓ 5 callersFunctionfind

A utility function to find set of an element i (uses path compression technique)

code/code/greedy_algorithms/src/kruskal_minimum_spanning_tree/kruskal.c:46

↓ 5 callersFunctionfind_optimal

code/code/data_structures/src/tree/multiway_tree/union_find/union_find.c:34

↓ 5 callersFunctionformat

code/js/moment.js:3347

↓ 5 callersMethodgcd

code/code/cryptography/src/affine_cipher/Affine.java:156

↓ 5 callersMethodget

code/code/data_structures/src/tree/space_partitioning_tree/interval_tree/interval_tree.java:271

↓ 5 callersMethodgetWeight

code/code/greedy_algorithms/src/fractional_knapsack/fractional_knapsack.java:86

↓ 5 callersFunctiongetZone

code/js/moment-timezone-with-data.js:395

← previous next →301–400 of 5,611, ranked by callers