diff --git a/annotated.html b/annotated.html index 40fb4bd65..07c4e3fd0 100644 --- a/annotated.html +++ b/annotated.html @@ -131,8 +131,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  CMinHeap  CMinHeapNode  Cmst - Cnode - CNode + CNode + Cnode  CPoint  Cquery  CQueue diff --git a/annotated_dup.js b/annotated_dup.js index 1cfaa4259..3c9d7167e 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -26,8 +26,8 @@ var annotated_dup = [ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ], [ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ], - [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ], + [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ], [ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ], diff --git a/classes.html b/classes.html index a30148dcf..fd5e25dca 100644 --- a/classes.html +++ b/classes.html @@ -111,24 +111,24 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); }) adaline (machine_learning)    Edge    -Node (data_structure)    +Node    stack   
  b  
-Entry (quadratic_probing)    +Entry (double_hashing)    Item    -node    +Node (data_structure)    stack_linkedList    -Entry (double_hashing)    +Entry (linear_probing)   
  l  
-Node    +node    stats_computer1 (statistics)    Btree    -Entry (linear_probing)    +Entry (quadratic_probing)   
  p  
stats_computer2 (statistics)    diff --git a/d0/d80/classgraph__coll__graph.map b/d0/d80/classgraph__coll__graph.map index a370e3986..3a104610f 100644 --- a/d0/d80/classgraph__coll__graph.map +++ b/d0/d80/classgraph__coll__graph.map @@ -1,7 +1,4 @@ - - - - - + + diff --git a/d0/d80/classgraph__coll__graph.md5 b/d0/d80/classgraph__coll__graph.md5 index 89761506c..b58206570 100644 --- a/d0/d80/classgraph__coll__graph.md5 +++ b/d0/d80/classgraph__coll__graph.md5 @@ -1 +1 @@ -47ca9a59948d4f2cb135e15d035200da \ No newline at end of file +8efd269804187eea2340c75ef8eaa740 \ No newline at end of file diff --git a/d0/d80/classgraph__coll__graph.svg b/d0/d80/classgraph__coll__graph.svg index 7becdd325..43d73dcf5 100644 --- a/d0/d80/classgraph__coll__graph.svg +++ b/d0/d80/classgraph__coll__graph.svg @@ -4,17 +4,17 @@ - - + + graph - + Node1 - -graph + +graph @@ -31,64 +31,9 @@ Node2->Node1 - - - adj - - - -Node3 - - -std::vector< int > - - - - - -Node3->Node2 - - - elements - - - -Node4 - - -list< int > - - - - - -Node4->Node1 - - - adj - - - -Node5 - - -list - - - - - -Node5->Node4 - - - next - - - -Node5->Node5 - - - next + + + adj diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html index 37869878b..4eae6b3d6 100644 --- a/d3/d40/graph__coloring_8cpp.html +++ b/d3/d40/graph__coloring_8cpp.html @@ -161,7 +161,7 @@ Functions
102  // (0)---(1)
103 
104  const int V = 4; // number of vertices in the graph
-
105  std::array <std::array <int, V>, V> graph = {
+
105  std::array <std::array <int, V>, V> graph = {
106  std::array <int, V>({0, 1, 1, 1}),
107  std::array <int, V>({1, 0, 1, 0}),
108  std::array <int, V>({1, 1, 0, 1}),
@@ -171,7 +171,7 @@ Functions
112  int m = 3; // Number of colors
113  std::array <int, V> color{};
114 
-
115  backtracking::graphColoring<V>(graph, m, color, 0);
+
115  backtracking::graphColoring<V>(graph, m, color, 0);
116  return 0;
117 }
@@ -208,7 +208,6 @@ Functions
addition_rule_dependent
double addition_rule_dependent(double A, double B, double B_given_A)
Definition: addition_rule.cpp:25
test2
void test2()
Definition: smallest_circle.cpp:173
std::pair
-
graph
Definition: bfs.cpp:3
random_tests
bool random_tests()
random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...
Definition: fibonacci_search.cpp:96
std::vector
STL class.
std::find
T find(T... args)
@@ -376,6 +375,7 @@ Functions
MAX
#define MAX
Definition: paranthesis_matching.cpp:16
stack
Definition: stack.h:26
power
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:76
+
graph
Graph algorithms.
main
int main()
Definition: successive_approximation.cpp:20
std::count
T count(T... args)
tests
void tests()
Definition: insertion_sort.cpp:109
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index 5fa642115..1e5dc9433 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -161,8 +161,8 @@ Static Private Member Functions
Returns
true if a cycle is detected, else false.
249  {
-
250  auto graphAjdList = graph.getAdjList();
-
251  auto vertices = graph.getVertices();
+
250  auto graphAjdList = graph.getAdjList();
+
251  auto vertices = graph.getVertices();
252 
253  std::vector<unsigned int> indegree(vertices, 0);
254  // Calculate the indegree i.e. the number of incident edges to the node.
@@ -255,7 +255,7 @@ Here is the call graph for this function:

It is a vector of "nodeStates" which represents the state node is in. It can take only 3 values: "not_visited", "in_stack", and "visited".

Initially, all nodes are in "not_visited" state.

212  {
-
213  auto vertices = graph.getVertices();
+
213  auto vertices = graph.getVertices();
214 
215  /** State of the node.
216  *
@@ -273,7 +273,7 @@ Here is the call graph for this function:
228  // node as it has already been checked for presence of cycle.
229  if (state[node] == not_visited) {
230  // Check for cycle.
-
231  if (isCyclicDFSHelper(graph.getAdjList(), &state, node)) {
+
231  if (isCyclicDFSHelper(graph.getAdjList(), &state, node)) {
232  return true;
233  }
234  }
@@ -386,7 +386,6 @@ Here is the call graph for this function: -
graph
Definition: bfs.cpp:3
std::vector< unsigned int >
std::queue::emplace
T emplace(T... args)
node
Definition: avltree.cpp:13
@@ -395,6 +394,7 @@ Here is the call graph for this function:
std::queue::front
T front(T... args)
CycleCheck::isCyclicDFSHelper
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:170
std::queue::pop
T pop(T... args)
+
graph
Graph algorithms.
std::queue::empty
T empty(T... args)
list
Definition: list_array.cpp:8
diff --git a/d4/d86/large__number_8h_source.html b/d4/d86/large__number_8h_source.html index e5f42190d..2daec7d69 100644 --- a/d4/d86/large__number_8h_source.html +++ b/d4/d86/large__number_8h_source.html @@ -396,6 +396,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
main
int main()
Definition: double_factorial.cpp:67
main
int main()
Definition: gcd_of_n_numbers.cpp:28
std::setprecision
T setprecision(T... args)
+
graph::breadth_first_search
std::vector< bool > breadth_first_search(const std::vector< std::vector< int >> &graph, int start)
Function performs the breadth first search algorithm over the graph.
Definition: breadth_first_search.cpp:95
std::vector::resize
T resize(T... args)
std::bitset< MAXN >
linear_probing::Entry::key
int key
key value
Definition: linear_probing_hash_table.cpp:37
@@ -409,6 +410,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
double_hashing::otherHashFxn
size_t otherHashFxn(int key)
Used for second hash function.
Definition: double_hash_hash_table.cpp:58
std::domain_error
STL class.
std::string
STL class.
+
std::equal
T equal(T... args)
std::shared_ptr
STL class.
MAX
#define MAX
Definition: fibonacci_fast.cpp:27
Graph::addVertices
void addVertices(unsigned int num=1)
Definition: cycle_check_directed_graph.cpp:118
@@ -430,7 +432,6 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
double_hashing
An implementation of hash table using double hashing algorithm.
linear_probing::Entry
Definition: linear_probing_hash_table.cpp:35
std::pair
-
graph
Definition: bfs.cpp:3
double_factorial_iterative
uint64_t double_factorial_iterative(uint64_t n)
Definition: double_factorial.cpp:17
double_hashing::removalInfo
void removalInfo(int key)
Definition: double_hash_hash_table.cpp:227
hash_chain::find
bool find(int x, int h) const
Find if a value and corresponding hash exist.
Definition: chaining.cpp:101
@@ -484,6 +485,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
std::scanf
T scanf(T... args)
get_clock_diff
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_trace.cpp:452
test2
void test2(const std::string &text)
Self test 2 - using 8x8 randomly generated key.
Definition: hill_cipher.cpp:505
+
graph::add_directed_edge
void add_directed_edge(std::vector< std::vector< int >> *graph, int u, int v)
Adds a directed edge from vertex u to vertex v.
Definition: breadth_first_search.cpp:66
std::setfill
T setfill(T... args)
std::reverse
T reverse(T... args)
Graph::Graph
Graph(unsigned int vertices, std::vector< Edge > const &edges)
Definition: cycle_check_directed_graph.cpp:88
@@ -514,6 +516,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
machine_learning::adaline::check_size_match
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:196
std::sqrt
T sqrt(T... args)
stack_idx
int stack_idx
pointer to track stack index
Definition: paranthesis_matching.cpp:23
+
main
int main()
Definition: breadth_first_search.cpp:161
test1
void test1()
Definition: kohonen_som_trace.cpp:233
std::vector::clear
T clear(T... args)
hash_chain::add
void add(int x, int h)
create and add a new node with a give value and at a given height
Definition: chaining.cpp:45
@@ -618,6 +621,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
quadratic_probing::addInfo
void addInfo(int key)
Definition: quadratic_probing_hash_table.cpp:207
double_hashing::display
void display()
Definition: double_hash_hash_table.cpp:143
double_hashing::remove
void remove(int key)
Definition: double_hash_hash_table.cpp:199
+
graph::add_undirected_edge
void add_undirected_edge(std::vector< std::vector< int >> *graph, int u, int v)
Adds an undirected edge from vertex u to vertex v. Essentially adds too directed edges to the adjacen...
Definition: breadth_first_search.cpp:81
print
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
main
int main(int argc, char **argv)
Definition: hamiltons_cycle.cpp:142
Graph::Graph
Graph(unsigned int vertices, AdjList &&adjList)
Definition: cycle_check_directed_graph.cpp:76
@@ -635,6 +639,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
quadratic_probing::Entry::Entry
Entry(int key=notPresent)
constructor
Definition: quadratic_probing_hash_table.cpp:38
sum_of_divisor
int sum_of_divisor(int num)
Definition: check_amicable_pair.cpp:21
stack::top
Type top()
Definition: stack.h:93
+
tests
void tests()
Definition: breadth_first_search.cpp:121
hamilton_cycle
bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)
Definition: hamiltons_cycle.cpp:30
data
int data[MAX]
test data
Definition: hash_search.cpp:24
linear_probing::add
void add(int key)
Definition: linear_probing_hash_table.cpp:161
@@ -658,7 +663,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
large_number::operator==
friend bool operator==(large_number const &a, large_number const &b)
Definition: large_number.h:155
machine_learning::adaline::operator<<
friend std::ostream & operator<<(std::ostream &out, const adaline &ada)
Definition: adaline_learning.cpp:76
std::exp
T exp(T... args)
-
std::begin
T begin(T... args)
+
std::vector::begin
T begin(T... args)
machine_learning::save_u_matrix
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
Definition: kohonen_som_topology.cpp:142
factorial
unsigned int factorial(unsigned int n)
Definition: factorial.cpp:8
std::greater
@@ -677,6 +682,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
double_hashing::doubleHash
int doubleHash(int key, bool searching)
Performs double hashing to resolve collisions.
Definition: double_hash_hash_table.cpp:71
main
int main()
Definition: fast_power.cpp:68
double_factorial_recursive
uint64_t double_factorial_recursive(uint64_t n)
Definition: double_factorial.cpp:30
+
graph
Graph algorithms.
hash_chain::hash_chain
hash_chain(int mod)
Construct a new chain object.
Definition: chaining.cpp:35
std::count
T count(T... args)
std::ptrdiff_t
@@ -690,7 +696,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
stack::display
void display()
Definition: stack.h:29
extendedEuclid
void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:70
test3
void test3()
Definition: kohonen_som_trace.cpp:414
-
std::stack::push
T push(T... args)
+
std::queue::push
T push(T... args)
graph::graph
graph(int n)
Constructor that intiliazes the graph on creation and set the connected components to 0.
Definition: connected_components.cpp:53
test
void test()
Definition: check_amicable_pair.cpp:56
ols_test
void ols_test()
Definition: ordinary_least_squares_regressor.cpp:369
@@ -752,7 +758,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
std::exit
T exit(T... args)
stack::clear
void clear()
Definition: stack.h:112
main
int main(int argc, char **argv)
Definition: adaline_learning.cpp:357
-
list< int >
+
list
Definition: list_array.cpp:8
std::memset
T memset(T... args)
std::hash
test_circle
void test_circle(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:196
diff --git a/d6/dec/breadth__first__search_8cpp__incl.map b/d6/dec/breadth__first__search_8cpp__incl.map new file mode 100644 index 000000000..284950310 --- /dev/null +++ b/d6/dec/breadth__first__search_8cpp__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d6/dec/breadth__first__search_8cpp__incl.md5 b/d6/dec/breadth__first__search_8cpp__incl.md5 new file mode 100644 index 000000000..c182cfa6a --- /dev/null +++ b/d6/dec/breadth__first__search_8cpp__incl.md5 @@ -0,0 +1 @@ +2a98cfbb17689fd58d600ee0d7a5f394 \ No newline at end of file diff --git a/d6/dec/breadth__first__search_8cpp__incl.svg b/d6/dec/breadth__first__search_8cpp__incl.svg new file mode 100644 index 000000000..062f16990 --- /dev/null +++ b/d6/dec/breadth__first__search_8cpp__incl.svg @@ -0,0 +1,98 @@ + + + + + + +graph/breadth_first_search.cpp + + + +Node1 + + +graph/breadth_first +_search.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +queue + + + + + +Node1->Node5 + + + + + +Node6 + + +vector + + + + + +Node1->Node6 + + + + + diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index c30ed4b0f..e665c59e1 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -151,7 +151,6 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
main
int main()
Definition: sudoku_solve.cpp:131
ciphers::HillCipher::generate_encryption_key
static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
Definition: hill_cipher.cpp:339
std::pair
-
graph
Definition: bfs.cpp:3
ciphers::HillCipher
Implementation of Hill Cipher algorithm.
Definition: hill_cipher.cpp:81
std::vector
STL class.
deleteNode
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
@@ -228,6 +227,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
std
STL namespace.
main
int main()
Definition: avltree.cpp:134
determinant_lu
double determinant_lu(const matrix< T > &A)
Definition: lu_decomposition.h:90
+
graph
Graph algorithms.
ciphers::HillCipher::rand_range
static const T2 rand_range(T1 a, T1 b)
Function to generate a random integer in a given interval.
Definition: hill_cipher.cpp:92
operator<<
static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition: hill_cipher.cpp:54
backtracking::solveSudoku
bool solveSudoku(std::array< std::array< int, V >, V > &mat, int i, int j)
Definition: sudoku_solve.cpp:91
diff --git a/d8/d9b/classgraph-members.html b/d8/d9b/classgraph-members.html index 2bb8d5325..9688dd6d6 100644 --- a/d8/d9b/classgraph-members.html +++ b/d8/d9b/classgraph-members.html @@ -97,19 +97,13 @@ $(document).ready(function(){initNavTree('dd/d9b/classgraph.html','../../'); ini

This is the complete list of members for graph, including all inherited members.

- - - + - - - - - - + + + + - -
addedge(int src, int dest) (defined in graph)graph
addEdge(int, int)graph
adj (defined in graph)graphprivate
addEdge(int, int)graph
adjgraphprivate
bfs(int s) (defined in graph)graph
connected_componentsgraphprivate
depth_first_search()graphprivate
explore(int, vector< bool > &)graphprivate
getConnectedComponents()graphinline
graph(int v) (defined in graph)graph
connected_componentsgraphprivate
depth_first_search()graphprivate
explore(int, vector< bool > &)graphprivate
getConnectedComponents()graphinline
graph(int n)graphinlineexplicit
printgraph() (defined in graph)graph
v (defined in graph)graphprivate
diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html index 82f01e901..f2939dbd1 100644 --- a/db/dc0/namespacebacktracking.html +++ b/db/dc0/namespacebacktracking.html @@ -198,11 +198,11 @@ template<size_t V>
77  // Consider this vertex v and try different colors
78  for (int c = 1; c <= m; c++) {
79  // Check if assignment of color c to v is fine
-
80  if (backtracking::isSafe<V>(v, graph, color, c)) {
+
80  if (backtracking::isSafe<V>(v, graph, color, c)) {
81  color[v] = c;
82 
83  // recur to assign colors to rest of the vertices
-
84  backtracking::graphColoring<V>(graph, m, color, v + 1);
+
84  backtracking::graphColoring<V>(graph, m, color, v + 1);
85 
86  // If assigning color c doesn't lead to a solution then remove it
87  color[v] = 0;
@@ -362,7 +362,7 @@ template<size_t V> false if the color is not safe to be assigned to the node
51  {
52  for (int i = 0; i < V; i++) {
-
53  if (graph[v][i] && c == color[i]) {
+
53  if (graph[v][i] && c == color[i]) {
54  return false;
55  }
56  }
@@ -808,13 +808,13 @@ template<size_t V>
mov
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
-
graph
Definition: bfs.cpp:3
std::cout
height
int height(node *root)
Definition: avltree.cpp:31
std::min
T min(T... args)
backtracking::minimax
int minimax(int depth, int node_index, bool is_max, const std::array< int, T > &scores, double height)
Definition: minimax.cpp:38
std::endl
T endl(T... args)
std
STL namespace.
+
graph
Graph algorithms.
std::max
T max(T... args)