|
⇤ ← Revision 1 as of 2010-12-18 06:59:02
Size: 618
Comment:
|
← Revision 2 as of 2010-12-18 07:52:52 ⇥
Size: 612
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 23: | Line 23: |
| * <koumudi>, <Student>, <SNIST> | * koumudi, Student, SNIST |
Book
Advanced Engineering Mathematics
Author
Erwin Kreyszig
Edition
8th Edition
g=Graph()
g = Graph({1:[4,5,6], 2:[4,5,6],3:[4,5,6],4:[1,2,3],5:[1,2,3],6:[1,2,3]});
g.plot()
g.edges()
[(1, 4, None), (1, 5, None), (1, 6, None), (2, 4, None), (2, 5, None),
(2, 6, None), (3, 4, None), (3, 5, None), (3, 6, None)] //output
g.num_edges()
9 //output
// this code is for demonstrating the COMPLETE BIPARTITE GRAPH and to calculate number of edges
Solution by:
- koumudi, Student, SNIST