Tutorial by Examples: en

To store a graph, two methods are common: Adjacency Matrix Adjacency List An adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. Adjacent means 'next to or adjoining something el...

The Assignment Operator is when you replace the data with an already existing(previously initialized) object with some other object's data. Lets take this as an example: // Assignment Operator #include <iostream> #include <string> using std::cout; using std::endl; class Foo { ...

Ok we have briefly looked over what the copy constructor and assignment constructor are above and gave examples of each now let's see both of them in the same code. This code will be similar as above two. Let's take this : // Copy vs Assignment Constructor #include <iostream> #include <s...

GENERATE detail-line

GO TO label GO TO label-1 label-2 label-3 DEPENDING ON identifier-1 GO TO label OF section GO. The last line example indicates that an ALTER statement is in play, and another part of the code will specify which actual label is the target of the jump.

Consider the dataframes left and right left = pd.DataFrame([['a', 1], ['b', 2]], list('XY'), list('AB')) left A B X a 1 Y b 2 right = pd.DataFrame([['a', 3], ['b', 4]], list('XY'), list('AC')) right A C X a 3 Y b 4 join Think of join as wanting to combine to dat...

The onTouchEvents() for nested view groups can be managed by the boolean onInterceptTouchEvent. The default value for the OnInterceptTouchEvent is false. The parent's onTouchEvent is received before the child's. If the OnInterceptTouchEvent returns false, it sends the motion event down the cha...

type Dog = Dog String dogName1 dog = case dog of Dog name -> name dogName2 (Dog name) -> name dogName1 and dogName2 are equivalent. Note that this only works for ADTs that have a single constructor. type alias Pet = { name: String , weight: Float ...

extern crate gtk; use gtk::prelude::*; use gtk::{Window, WindowType, Label, Entry, Box as GtkBox, Orientation}; fn main() { if gtk::init().is_err() { println!("Failed to initialize GTK."); return; } let window = Window::new(WindowType::Toplevel); ...

A closure is a procedure that holds internal state: Define a procedure that returns a closure The procedure make-an-adder takes one argument x and returns a function that closes over the value. Or to put it another way, x is within the lexical scope of the returned function. #lang racket (define...

This program is complimentary to Hello TCP Server program, you can run either of them to check the validity of each other. The program flow is quite common with Hello TCP server, so make sure to take a look at that too. Here's the code - #include <cstring> #include <iostream> #includ...

Prepared statements See Prepared statements in MySQLi for how to prepare and execute a query. Binding of results Object-oriented style $stmt->bind_result($forename); Procedural style mysqli_stmt_bind_result($stmt, $forename); The problem with using bind_result is that it requires the s...

One of the most important implementations of Dynamic Programming is finding out the Longest Common Subsequence. Let's define some of the basic terminologies first. Subsequence: A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the orde...

Before reading this example, it is highly recommended that you read Introduction to Trie first. One of the easiest ways of implementing Trie is using linked list. Node: The nodes will consist of: Variable for End-Mark. Pointer Array to the next Node. The End-Mark variable will simply denot...

You can do neat things via the results of Array "comprehensions"... Like assign multiple variables... from the result of a looping for statement... [express,_] = (require x for x in ['express','underscore']) Or a syntactically sweet version of a "mapped" function call, etc.....

Using the NotificationCenter of iOS, which can be very powerful, you are able to intercept certain app-wide events: NotificationCenter.default.addObserver( self, selector: #selector(ViewController.do(_:)), name: NSNotification.Name.UIApplicationDidBecomeActive, o...

Before reading this example, it is required to have a brief idea on edge-relaxation. You can learn it from here Bellman-Ford Algorithm is computes the shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Even though it is slower than Dijkstra's Algorithm, i...

In case of problems, enable the internal logger <nlog internalLogFile="c:\log.txt" internalLogLevel="Trace"> <targets> <!-- target configuration here --> </targets> <rules> <!-- log routing rules --> </rules&gt...

In case of problems, enable the internal logger. C# example: // set internal log level InternalLogger.LogLevel = LogLevel.Trace; // enable one of the targets: file, console, logwriter: // enable internal logging to a file (absolute or relative path. Don't use layout renderers) InternalL...

To understand this example, it is recommended to have a brief idea on Bellman-Ford single source shortest path algorithm which can be found here In Bellman-Ford algorithm, to find out the shortest path, we need to relax all the edges of the graph. This process is repeated at most (V-1) times, where...