Let's take a look at that. Let's think about adding some edges here.

In our last question, we used a list of tuples to represent a graph where each tuple represented and edge between nodes.

There are two different ways that we can add to this graph.

So from A, we look at the neighbors of A. The neighbors of A are B and C.

Edge Smoothing

So Kv which is the number of neighbors is 4.

And the semantics are the i jth entry of the matrix is 1.

Remember the H value and the L value were defined specifically to be well, you follow a bunch of green edges and then you follow one red edge.

We have an edge between node 1 and 2, an edge between node 2 and 4, and edge between node 5 and 9, etc.

This is just kind of a random selection of big cities in the US, but with emphasis on places I've lived.

Find Edges

Detect Edges

Edge Detection

It has to do this which using the implementation that we're looking at is another end.

For example, if nodes was 1, 2, 3, one possible solution is a graph that has an edge between 1 and 3, and edge between 1 and 2, and an edge between 2 and 3.

Top Edge Detection

Right Edge Detection

Bottom Edge Detection

Left Edge Detection

So given all these nicely decorated nodes, we now have a rule for figuring out which ones are the bridge edges and this is the rule.

I'll just hold on to it for a while.

The approximate diameter, it's a three inch (3 ) shell mill

But with a Warren Ellis edge.

You have a Warren Ellis edge.

This is still not quite what we're looking for, but let's do an analysis of this graph then call it a day.

You can now just focus on that graph. So here's our graph.

Let's look at what happens if you loop on all the different values of n from 1 to 9 and print n and the number of edges in the clique.

It'd be nice to be able to answer this question in a little bit more generality.

It looks like b was our winner.

Create a New Edge

Now, the BA edge is already in there, but the BC edge is not.

Select the rectangle tool again and start from this upper edge.

With this assignment, we want you to write a function create_tour that takes as input a list of nodes and outputs a graph as a list of tuples representing edges between nodes that have an Eulerian tour.

Well, it's clear that the largest number of edges you can have is for the complete graph.

Now what would happen to the H value or the L value if we had one of these edges.

Is red bigger than black minus blue?

The second node can't connect to anything else and the third node can't connect to anything else.

Edges aren't localizable.

Now, I've filled out almost all of this deterministic equivalent.

So, this is the vertical mask applied to finding horizontal edges.

So, in particular, I want you to think about in this quiz, an un directed graph It has n vertices. There's no parallel edges.

What happens if all the nodes that are not in the beginning and ending nodes have to had even degree because the path has to go in one edge and out another edge.

Okay, on each of the edges of the graph.

Here's a planar graph on five nodes.

If you think about three times the number of regions, the number of edges has to be at least that big, though, we're counting each edge twice, because each edge can actually participate in two regions.