Node1: Node2, Node3Above is an undirected graph because
Node2: Node1
Node3: Node1
Node1
is connected to Node2
and Node3
, and that information is consistent with the connections Node2
and Node3
show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then Node2: Node1
would mean there the directed edge is pointing from Node2
towards Node1
.
We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.
var undirectedG = {This can also be more simply represented as an array where the nodes just have numbers rather than string labels.
Node1: ["Node2", "Node3"],
Node2: ["Node1"],
Node3: ["Node1"]
};
var undirectedGArr = [
[1, 2], # Node1
[0], # Node2
[0] # Node3
];
James
, Jill
, Jenny
, and Jeff
. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny.
undirectedAdjList
should only contain four nodes.
testString: assert(Object.keys(undirectedAdjList).length === 4, 'undirectedAdjList
should only contain four nodes.');
- text: There should be an edge between Jeff
and James
.
testString: assert(undirectedAdjList.James.indexOf("Jeff") !== -1 && undirectedAdjList.Jeff.indexOf("James") !== -1, 'There should be an edge between Jeff
and James
.');
- text: There should be an edge between Jill
and Jenny
.
testString: assert(undirectedAdjList.Jill.indexOf("Jenny") !== -1 && undirectedAdjList.Jill.indexOf("Jenny") !== -1, 'There should be an edge between Jill
and Jenny
.');
- text: There should be an edge between Jeff
and Jenny
.
testString: assert(undirectedAdjList.Jeff.indexOf("Jenny") !== -1 && undirectedAdjList.Jenny.indexOf("Jeff") !== -1, 'There should be an edge between Jeff
and Jenny
.');
```