MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / get_frequency_table

Function get_frequency_table

graphs/frequent_pattern_graph_miner.py:53–71  ·  view source on GitHub ↗

Returns Frequency Table

(edge_array)

Source from the content-addressed store, hash-verified

51
52
53def get_frequency_table(edge_array):
54 """
55 Returns Frequency Table
56 """
57 distinct_edge = get_distinct_edge(edge_array)
58 frequency_table = {}
59
60 for item in distinct_edge:
61 bit = get_bitcode(edge_array, item)
62 # print('bit',bit)
63 # bt=''.join(bit)
64 s = bit.count("1")
65 frequency_table[item] = [s, bit]
66 # Store [Distinct edge, WT(Bitcode), Bitcode] in descending order
67 sorted_frequency_table = [
68 [k, v[0], v[1]]
69 for k, v in sorted(frequency_table.items(), key=lambda v: v[1][0], reverse=True)
70 ]
71 return sorted_frequency_table
72
73
74def get_nodes(frequency_table):

Callers 1

Calls 3

get_distinct_edgeFunction · 0.85
get_bitcodeFunction · 0.85
countMethod · 0.80

Tested by

no test coverage detected