
Strongly connected directed graph synchronization network leader election  the flooding algorithm
20100221
1, directed graph, if all paths between any two nodes if a strongly connected graph 2 Algorithm requires the process to know the diameter diam map Each process to maintain a record of the largest UID (originally their own UID). In each round, each pr

Strongly connected directed graph algorithm for synchronous networksynBFS
20100221
In the running at any one time, there is always a process is marked. First time is i0. When the process of i0 in the first round to all the neighboring nodes to send a search message. In each round, if a process does not mark a search message is rece

Digraph of strongly connected components (scc): Tarjan algorithm
20100228
1, in a directed graph G, two vertices if there exists at least one path, said two vertices strongly connected (strongly connected). Directed graph G if every two vertices are strongly connected, that G is a strong and connected. Nonstrongly connect

POJ 1904 King's Quest [Tarjan algorithm to solve the directed graph strongly connected components of]
20100607
King's Quest Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 2957 Accepted: 993 Case Time Limit: 2000MS Description Once upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew a

Directed graph visualization using graphviz
20101001
Will have to map digital, you can use an adjacency matrix. Computer map of this series of processing (such as seeking closure), after treatment to see if the plan, to learn from this powerful open source tools graphviz. 1. Graphviz Introduction Graph

Oracle tree query start with ... connect by usage profile & sql directed graph problems looking at the new ...
20101112
ORACLE is a relational database management system that uses a table in the form of organizing data in some data in the table is also showing a tree structure of the contact. For example, we now discuss the employee information table EMP, which contai

Weighted directed graph  the right side of the value of nonnegative case of the singlesource shortest path problem
20100607
1. Problem Description: Given a weighted directed graph D with source v, seeking from the other vertex v to D, the shortest path. Limited to one side of the weight is greater than or equal to 0. 2. Java implementation: package boke.graph.shortpath1;

Graph adjacency table that the degree of the nodes (undirected graph) the degree of (directed graph)
20100629
#include<iostream> #include<string.h> using namespace std; #define MAX_VERTEX_NUM 50 // The largest number of nodes defined typedef enum{DG,UDG}GraphKind; // Define the type of graph DG( Directed graph ) UDG( Undirected graph ) typedef char Ve

Oracle query tree structures start with ... connect by use of a directed graph Introduction & sql question looking forward to the new ...
20101112
ORACLE is a relational database management system, which is organized with a table of data, in some data in the table also shows the link tree. For example, we now discuss the employee information table EMP, which contains the employee number (EMPNO)

Cross said directed graph and the vertex list out of calculation
20100629
#include<iostream> #define MAX_VERTEX_NUM 50 using namespace std; // Defines vertex information data type typedef char VertexData; // Defines the type of diagram typedef enum{DG,UDG} GraphKind; // Define arcnode typedef struct ArcNode { int tailvex

Synchronous ring leader choice  time slice algorithm
20100221
In stage 1,2, ... in the calculation, each of n consecutive rounds by the composition. Each stage has a special UID carrying token ring has a circulation. More specifically, in the included wheel (v1) n +1 ,..., vn of the stage, only the token with

Automation compile dependency
20101204
Using c + + implementation of a system that is too large, rely on very complex, but also to change very frequently. Maintenance of the original Makefile by hand inside the link and incl, often because of a lowlevel modules will lead to largescale c

GEF automatic layout
20100421
Automatic layout feature, we can did not contain graphic information in the file to graphically displayed Typical examples such as Jiang 1 Zu interface, reverse engineer Java class map, the map Zhong coordinates of each pixel should Bixu are automati

Common library python!
20100701
Learning Python On this page ... (basic installation 2. Python Documentation 2.1 Recommended resource sites 2.2 Other references 2.3 Code Sample 3. Useful Tools 3.1 Python IDE 3.2 Builtin library to use reference 3.3 Common thirdparty libraries 3.4

<Switch> Network game synchronization
20100601
Online Games synchronization 200748 15:22:11 Source: unknown Anonymous Synchronization in the network game is very important, it guarantees that each player can see things on the screen roughly the same. Actually, solve the synchronization problem

The network time synchronization Android
20110513
Android's network time synchronization with SNTP protocolindependent, and even with TCP / IP protocol is also irrelevant. Application from the set can be learned automatically synchronize network time option only changes the Settings.System.AUTO_TIM

Solving largescale map of the connected components
20110728
A large scale sparse connectivity graph to solve the background of a map component manufacturers need to check whether the road network is connected, such as the existence of an island (can not reach, can not go out)? Typically, if there is an island

About Windows peer network
20100325
Overview of the peer network Can be used on other networks exist in the Internet edge of a relatively powerful computer (personal computer), the implementation of a more clientbased computing tasks more advanced tasks. Modern PC with fast processors

Beauty of Mathematics Series 6  Graph Theory and Web Crawler (Web Crawlers)
20100326
Author: Wu Jun, Google Fellow [ Discrete Mathematics is an important branch of modern mathematics is the mathematical foundation of computer science. It consists of mathematical logic, set theory, graph theory and modern algebra in four branches. Mat

[Transferred] to the bipartite graph are learning a friend would be useful
20100415
Bipartite graph matching algorithm summary Bipartite graph matching algorithm summary Bipartite graph maximum matching algorithm of Hungary Bipartite graph is a graph, its vertices can be categorized as two sets X and Y, all the edges associated with