ivycheung1208

/* Implement a directed graph using adjacency list representation
 * Depth First Traversal for a Graph: http://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/
 * Breadth First Traversal for a Graph http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/
 * Connectivity in a directed graph: http://www.geeksforgeeks.org/connectivity-in-a-directed-graph/
 */

#ifndef GRAPH_H
#define GRAPH_H

#include <iostream>

Shekharrajak

from sympy import *

# https://www.rose-hulman.edu/~finn/CCLI/Notes/day09.pdf

a0, a1, a2, a3, t = symbols('a0 a1 a2 a3 t')

polynomial = a0 + a1*t + a2*t**2 + a3*t**3
polynomial_d = diff(polynomial, t)

p0, v0, p1, v1 = symbols('p0 v0 p1 v1')

bpgergo

import random
import multiprocessing
from itertools import starmap, izip, repeat, imap
from operator import mul

def calc_row_of_product_matrix(a_row, b, izip=izip):
    '''Calculate a row of the product matrix P = A * B
    Arguments:
      a_row is af A
      b is the B matrix

vladshablinsky

Work on source modified time support. List of pull requests:

Add SubversionDownloadStrategy#source_modified_time

Override VCSDownloadStrategy#source_modified_time

download_strategy: use svn info --xml

download_strategy: cvs source_modified_time

Shekharrajak

SVG circular progress: CSS animated & Angle gradient

SVG Circular Progress CSS Animated Angle Gradient

By Pouya Saadeghi

Forked from Pouya Saadeghi (پویا صادقی)'s Pen SVG circular progress: CSS animated & Angle gradient .

rupl

// Load fonts async by default
// Load sync from SW cache when available.
//
// Snippet assumes your Service Worker caches fonts as part of installation, so that
// an 'activated' Service Worker means the fonts are cached with 100% confidence.
if (
  'serviceWorker' in navigator &&
  navigator.serviceWorker.controller !== null &&
  navigator.serviceWorker.controller.state === 'activated'
) {

dufferzafar

mycodeschool

#include<iostream>
#include<cstdlib>
#include<set>
using namespace std;

struct Node {
    int data;
    struct Node *next;
};
int length(struct Node *head) {

mycodeschool

/*Queue - Linked List implementation*/
#include<stdio.h>
#include<stdlib.h>
struct Node {
	int data;
	struct Node* next;
};
// Two glboal variables to store address of front and rear nodes. 
struct Node* front = NULL;
struct Node* rear = NULL;

vishaltelangre

ERROR
=======

$ gem install pg -v '0.17.0'                                                                                   
Building native extensions.  This could take a while...
ERROR:  Error installing pg:
	ERROR: Failed to build gem native extension.

        /home/vishal/.rvm/rubies/ruby-1.9.3-p194/bin/ruby extconf.rb
checking for pg_config... yes