Graphs in computer science: definition, types, application, examples. Graph Theory in Computer Science

Graphs in computer science are a way of defining relationships in the totality of elements. These are the main objects of study of graph theory.

Basic definitions

What does a graph in computer science consist of? It includes many objects called vertices or nodes, some pairs of which are connected by so-called. ribs. For example, the graph in Figure (a) consists of four nodes, labeled A, B, C, and D, of which B is connected to each of the other three vertices by edges, and C and D are also connected. Two nodes are adjacent if they are connected by an edge. The figure shows a typical way of building graphs using computer science. The circles represent the vertices, and the lines connecting each pair of them are edges.

? . . , , – , , A B, . , - . , . , (b), . , , .

. , ARPANET, 1970 , 13 . , . , 13- , . . , .

, , . 13- ARPANET , - , , .

, . () , , – , , , , , , -, .

, . , , , . , MIT, BBN, RAND, UCLA ARPANET. . , SRI, STAN, UCLA, SRI, UTAH, MIT . , , . , .

– , , LINC, CASE, CARN, HARV, BBN, MIT, LINC. , , , , , .

: SRI, STAN, UCLA, SRI , SRI, STAN, UCLA, RAND, BBN, UTAH, SRI .

ARPANET . : - , . – . . , , , , , , , , (. . ) , , .

: ()

, . , . , ARPANET – . , , .

, , . , , .

, , , . , : – , – C, D , .

, :

• ;
• , .

, . , . , , , .

. , , .

? , . – , ( ) . , - , , , , . , , , , .

-. , , , . , , , . , - , , , , , .

– , , . , , . , , , . - , . , , , , , .

, , , , , , .

, . : , , - , - . , , , . . , , , .

. , 18- . , , , , , . , , , , , , , , . , , , , , . , : , , .

, , – , , , .

, , , . . , . , MIT, BBN, RAND, UCLA 3, MIT, UTAH – 1. , , : . , LINC SRI 3, , , , 1 2, .

. .

, , , ( ):

• 1.
• ( ) 2.
• ( , ) 3.

, , - . , , .

, , . , , , , .

, .

, , , , : , , .

« »: , , .

« » 1960- . - 680 . 296 , . ( ), , , , . , .

64 , , , , .

, . : , , . , , , , .