Isnin, 21 November 2011
Learning something from a swarm of bees and a colony of ants
Khamis, 17 November 2011
Learning English with a Wide Heart in the Rainy Day
a: feeling, qualities or opinionsb: size, age, temperature or measurementc: colourd: nationality or origine: substance or material
Enjoy my responsible is my noble to serve with my people to develop my nation attitude begin with my students. I am projecting my seriousness effort to my students with nice lesson styles during the class. I hope my noble efforts will grow in each of my students heart. Insya-Allah.
Khamis, 6 Oktober 2011
I'm PrOuD WiTh My InTeRnShIp StUdEnts iF ThEy CaN Do LiKe ThIs
Jumaat, 12 Ogos 2011
Virtue in Distress
Assalamualaikum...
Sabtu, 21 Mei 2011
Special Test To Whom It May Concern
Let G = (V,E) be a directed graph with vertex set V and edge set E. Size of set V is n and size of set E is m. G has two distinguished vertices, a source s and a sink t. The network was shown as below.
2) Minimum spanning trees
Basically a minimum spanning tree is a subset of the edges of the graph, so that there’s a path form any node to any other node and that the sum of the weights of the edges is minimum.
Here’s the minimum spanning tree of the example:
Look at the above image closely. It contains all of the initial nodes and some of the initial edges. Actually it contains exactly n – 1 edges, where n is the number of nodes. It’s called a tree because there are no cycles.
You can think of the graph as a map, with the nodes being cities, the edges passable terrain, and the weights the distance between the cities.
It’s worth mentioning that a graph can have several minimum spanning trees. Think of the above example, but replace all the weight with 1. The resulting graph will have 6 minimum spanning trees.
Given a graph, find one of its minimum spanning trees.
3) Simplex Method
Maximize Z = 2x1 - 3x2 + 4x3 subject to | |||||||
|