poorah/b2b-charge-sales-system

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/imdb-crawler

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/simple-e-commerce-rest-api

Simple E-commerce REST API application using Node.js, Express.js, MongoDB

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/simple-node.js-crud-application-on-a-form

Simple Node.js CRUD application on a form

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/my-first-simple-vue.js-application

My first simple e-commerce frontend using Vue.js

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/bellman-ford-algorithm

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a negative weighted graph.

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/strongly-connected-components

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph.

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/topological-sorting-for-dag

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG.

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/previsited-and-postvisited-times-in-dfs-of-a-graph

Pre-visit number tells the time at which the node gets into the recursion stack and Post-visit number tells the time at which the node comes out from recursion stack of DFS.

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/labeled-dfs-algorithm-implemented-with-c

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/graph-exploration-algorithm

Graph exploration algorithm

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/simple-c-store-database

Simple store database implemented with C++

Last synced: about 1 year ago - Stars: 0 - Forks: 0

poorah/infix-to-postfix-expression-converter-and-evaluator

In general, expressions usually are in infix format. So, we have to convert them into postfix expressions and then evaluate them. For that, you can use Infix to Postfix Converter and evaluator program wrote in C++.

Last synced: about 1 year ago - Stars: 0 - Forks: 0