mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
aaa08b0150
* delete secant method - it is identical to regula falsi * document + improvize root finding algorithms * attempt to document gaussian elimination * added file brief * commented doxygen-mainpage, added files-list link * corrected files list link path * files-list link correction - this time works :) * document successive approximations * cleaner equation * updating DIRECTORY.md * documented kmp string search * document brute force string search * document rabin-karp string search * fixed mainpage readme * doxygen v1.8.18 will suppress out the #minipage in the markdown * cpplint correction for header guard style * github action to auto format source code per cpplint standard * updated setting to add 1 space before `private` and `public` keywords * auto rename files and auto format code * added missing "run" for step * corrected asignmemt operation * fixed trim and assign syntax * added git move for renaming bad filenames * added missing pipe for trim * added missing space * use old and new fnames * store old fname using echo * move files only if there is a change in filename * put old filenames in quotes * use double quote for old filename * escape double quotes * remove old_fname * try escape characters and echo" * add file-type to find * cleanup echo * ensure all trim variables are also in quotes * try escape -quote again * remove second escpe quote * use single quote for first check * use carets instead of quotes * put variables in brackets * remove -e from echo * add debug echos * try print0 flag * find command with while instead of for-loop * find command using IFS instead * 🎉 IFS fix worked - escaped quotes for git mv * protetc each word in git mv .. * filename exists in lower cases - renamed * 🎉 git push enabled * updating DIRECTORY.md * git pull & then push * formatting filenamesd7af6fdc8c
* formatting source-code ford7af6fdc8c
* remove allman break before braces * updating DIRECTORY.md * added missing comma lost in previous commit * orchestrate all workflows * fix yml indentation * force push format changes, add title to DIRECTORY.md * pull before proceeding * reorganize pull commands * use master branches for actions * rename .cc files to .cpp * added class destructor to clean up dynamic memory allocation * rename to awesome workflow * commented whole repo cpplint - added modified files lint check * removed need for cpplint * attempt to use actions/checkout@master * temporary: no dependency on cpplint * formatting filenames153fb7b8a5
* formatting source-code for153fb7b8a5
* updating DIRECTORY.md * fix diff filename * added comments to the code * added test case * formatting source-code fora850308fba
* updating DIRECTORY.md * added machine learning folder * added adaline algorithm * updating DIRECTORY.md * fixed issue [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * add cmath for same bug: [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * formatting source-code forf8925e4822
* use STL's inner_product * formatting source-code forf94a330594
* added range comments * define activation function * use equal initial weights * change test2 function to predict * activation function not friend * previous commit correction * added option for predict function to return value before applying activation function as optional argument * added test case to classify points lying within a sphere * improve documentation for adaline * formatting source-code for15ec4c3aba
* added cmake to geometry folder * added algorithm include for std::max * add namespace - machine_learning * add namespace - statistics * add namespace - sorting * added sorting algos to namespace sorting * added namespace string_search * formatting source-code forfd69530515
* added documentation to string_search namespace * feat: Add BFS and DFS algorithms to check for cycle in a directed graph * Remove const references for input of simple types Reason: overhead on access * fix bad code sorry for force push * Use pointer instead of the non-const reference because apparently google says so. * Remove a useless and possibly bad Graph constuctor overload * Explicitely specify type of vector during graph instantiation * updating DIRECTORY.md * find openMP before adding subdirectories * added kohonen self organizing map * updating DIRECTORY.md * remove older files and folders from gh-pages before adding new files * remove chronos library due to inacceptability by cpplint * use c++ specific static_cast instead * initialize radom number generator * updated image links with those from CPP repository * rename computer.... folder to numerical methods * added durand kerner method for root computation for arbitrarily large polynomials * fixed additional comma * fix cpplint errors * updating DIRECTORY.md * convert to function module * update documentation * move openmp to main loop * added two test cases * use INT16_MAX * remove return statement from omp-for loop and use "break" * run tests when no input is provided and skip tests when input polynomial is provided * while loop cannot have break - replaced with continue and check is present in the main while condition * (1) break while loop (2) skip runs on break_loop instead of hard-break * add documentation images * use long double for errors and tolerance checks * make iterator variable i local to threads * add critical secions to omp threads * bugfix: move file writing outside of the parallel loop othersie, there is no gurantee of the order of roots written to file * rename folder to data_structures * updating DIRECTORY.md * fix ambiguous symbol `size` * add data_structures to cmake * docs: enable tree view, add timestamp in footer, try clang assistaed parsing * doxygen - open links in external window * remove invalid parameter from function docs * use HTML5 img tag to resize images * move file to proper folder * fix documentations and cpplint * formatting source-code foraacaf9828c
* updating DIRECTORY.md * cpplint: add braces for multiple statement if * add explicit link to badges * remove duplicate line Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove namespace indentation * remove file associations in settings * add author name * enable cmake in subfolders of data_structures * create and link object file * cpp lint fixes and instantiate template classes * cpp lint fixes and instantiate template classes Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint - ignore `build/include` Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * disable redundant gcc compilation in cpplint workflow Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * template header files contain function codes as well and removed redundant subfolders Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * remove semicolons after functions in a class Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint header guard style Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove semilon Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added LU decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added QR decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * use QR decomposition to find eigen values Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * use std::rand for thread safety Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * move srand to main() Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint braces correction Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updated eigen value documentation Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * fix matrix shift doc Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * rename CONTRIBUTION.md to CONTRIBUTING.md #836 * remove 'sort alphabetical order' check * added documentation check * remove extra paranthesis * added gitpod * added gitpod link from README * attempt to add vscode gitpod extensions * update gitpod extensions * add gitpod extensions cmake-tools and git-graph * remove gitpod init and add commands * use init to one time install doxygen, graphviz, cpplint * use gitpod dockerfile * add ninja build system to docker * remove configure task * add github prebuild specs to gitpod * disable gitpod addcommit * update documentation for kohonen_som * added ode solve using forward euler method * added mid-point euler ode solver * fixed itegration step equation * added semi-implicit euler ODE solver * updating DIRECTORY.md * fix cpplint issues - lines 117 and 124 * added documentation to ode group * corrected semi-implicit euler function * updated docs and test cases better structure * replace `free` with `delete` operator * formatting source-code forf55ab50cf2
* updating DIRECTORY.md * main function must return * added machine learning group * added kohonen som topology algorithm * fix graph image path * updating DIRECTORY.md * fix braces * use snprintf instead of sprintf * use static_cast * hardcode character buffer size * fix machine learning groups in documentation * fix missing namespace function * replace kvedala fork references to TheAlgorithms * fix bug in counting_sort Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Anmol3299 <mittalanmol22@gmail.com>
117 lines
2.9 KiB
C++
117 lines
2.9 KiB
C++
#include <limits.h>
|
|
#include <iostream>
|
|
|
|
using namespace std;
|
|
|
|
// Wrapper class for storing an edge
|
|
class Edge {
|
|
public:
|
|
int src, dst, weight;
|
|
};
|
|
|
|
// Wrapper class for storing a graph
|
|
class Graph {
|
|
public:
|
|
int vertexNum, edgeNum;
|
|
Edge *edges;
|
|
|
|
// Constructs a graph with V vertices and E edges
|
|
Graph(int V, int E) {
|
|
this->vertexNum = V;
|
|
this->edgeNum = E;
|
|
this->edges = (Edge *)malloc(E * sizeof(Edge));
|
|
}
|
|
|
|
// Adds the given edge to the graph
|
|
void addEdge(int src, int dst, int weight) {
|
|
static int edgeInd = 0;
|
|
if (edgeInd < this->edgeNum) {
|
|
Edge newEdge;
|
|
newEdge.src = src;
|
|
newEdge.dst = dst;
|
|
newEdge.weight = weight;
|
|
this->edges[edgeInd++] = newEdge;
|
|
}
|
|
}
|
|
};
|
|
|
|
// Utility function to print distances
|
|
void print(int dist[], int V) {
|
|
cout << "\nVertex Distance" << endl;
|
|
for (int i = 0; i < V; i++) {
|
|
if (dist[i] != INT_MAX)
|
|
cout << i << "\t" << dist[i] << endl;
|
|
else
|
|
cout << i << "\tINF" << endl;
|
|
}
|
|
}
|
|
|
|
// The main function that finds the shortest path from given source
|
|
// to all other vertices using Bellman-Ford.It also detects negative
|
|
// weight cycle
|
|
void BellmanFord(Graph graph, int src) {
|
|
int V = graph.vertexNum;
|
|
int E = graph.edgeNum;
|
|
int dist[V];
|
|
|
|
// Initialize distances array as INF for all except source
|
|
// Intialize source as zero
|
|
for (int i = 0; i < V; i++) dist[i] = INT_MAX;
|
|
dist[src] = 0;
|
|
|
|
// Calculate shortest path distance from source to all edges
|
|
// A path can contain maximum (|V|-1) edges
|
|
for (int i = 0; i <= V - 1; i++)
|
|
for (int j = 0; j < E; j++) {
|
|
int u = graph.edges[j].src;
|
|
int v = graph.edges[j].dst;
|
|
int w = graph.edges[j].weight;
|
|
|
|
if (dist[u] != INT_MAX && dist[u] + w < dist[v])
|
|
dist[v] = dist[u] + w;
|
|
}
|
|
|
|
// Iterate inner loop once more to check for negative cycle
|
|
for (int j = 0; j < E; j++) {
|
|
int u = graph.edges[j].src;
|
|
int v = graph.edges[j].dst;
|
|
int w = graph.edges[j].weight;
|
|
|
|
if (dist[u] != INT_MAX && dist[u] + w < dist[v]) {
|
|
cout << "Graph contains negative weight cycle. Hence, shortest "
|
|
"distance not guaranteed."
|
|
<< endl;
|
|
return;
|
|
}
|
|
}
|
|
|
|
print(dist, V);
|
|
|
|
return;
|
|
}
|
|
|
|
// Driver Function
|
|
int main() {
|
|
int V, E, gsrc;
|
|
int src, dst, weight;
|
|
cout << "Enter number of vertices: ";
|
|
cin >> V;
|
|
cout << "Enter number of edges: ";
|
|
cin >> E;
|
|
Graph G(V, E);
|
|
for (int i = 0; i < E; i++) {
|
|
cout << "\nEdge " << i + 1 << "\nEnter source: ";
|
|
cin >> src;
|
|
cout << "Enter destination: ";
|
|
cin >> dst;
|
|
cout << "Enter weight: ";
|
|
cin >> weight;
|
|
G.addEdge(src, dst, weight);
|
|
}
|
|
cout << "\nEnter source: ";
|
|
cin >> gsrc;
|
|
BellmanFord(G, gsrc);
|
|
|
|
return 0;
|
|
}
|