Commit c683199

committed

Undirected Graph using Adjacency List

1 parent 0685eb9 commit c683199Copy full SHA for c683199

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,9 @@`
	`1`	`+'''`
	`2`	`+An array/dictionary of lists is used. Size of the array/dictionary is equal to the number of vertices. Let the array be array[].`
	`3`	`+An entry array[i] represents the list of vertices adjacent to the ith vertex. This representation can also be used to represent a weighted graph.`
	`4`	`+The weights of edges can be represented as lists of pairs.`
	`5`	`+`
	`6`	`+The Implementation will be same as Directed Graph, but this time the connection will be done both ways.`
	`7`	`+If v1 => v2 then v2 => v1`
	`8`	`+Or v1 <=> v2`
	`9`	`+'''`

Comments

(0)