arduinobabyroom

arduinobletheorytoscd110

Bosch SCD110 communication with Arduino Ble

arduinodcmotorexample

arduinoexample2

Seven Segment Display Example Arduino

arduinolcdandclock

arduinomyfirstwork

autochangelibraryfile

autologinandsendmessageinstagram

buyticket

Android

c--begginerexamples

C# Beginer Examples

c_chatexample

Chat programming with C

chromeextensionforworkpresentation

I created this extension for working lessons in presentation with @BurcuAgdar and the extension can translates and adds notes in pdf , now this is firs work and example right now.

cisco-packet-tracer-example-design-

computerselectionsystem

Asp .net core mvc example

convert2xml

simple example C

dataminingexamples

db_university

DB example with postgreSql

demolinux-containerunderstand

dijkstra_algorithm

Dijkstra's algorithm forms the basis of modern journey planner search algorithms and provides an optimal solution to simple searches. While planning routes in such a combined network, some constraints as switching the mode of transportation frequently or unacceptable transfer counts must be considered. For instance, Table 1 shows the result path produced by the original Dijkstra’s algorithm for a query from the origin stop ‘10036-Konak’ to the destination stop ‘40120-Tınaztepe Kampüs Son Durak’. The path consists of 23 stops and 12 different lines, thus 11 transfers are required to complete the journey. Producing such an unefficient path should be avoided.

do180-apps

dynamicprogrammingandgreedy

DynamicProgrammingandGreedy

easymovie

android app web version

ebbcommunity

EBB Social Community

emirhanbilge

filmscript

Film script analysis

firstsetup

flaskmyweb

my web site with Python Flask

hashmap

HashMap with Java

homomorphicencryption

installation