Graph nodes and edges in LangChain - Mini Project: Build & Apply

Graph nodes and edges

📖 Scenario: You are building a simple graph structure using LangChain to represent connections between places in a city. Each place is a node, and the roads between them are edges.

🎯 Goal: Create a graph with nodes and edges using LangChain's graph components. You will first set up nodes, then configure a threshold for edge weights, add edges based on that threshold, and finally complete the graph setup.

📋 What You'll Learn

Create a dictionary called nodes with these exact entries: 'Library': 'A place with books', 'Cafe': 'A place to drink coffee', 'Park': 'A place to relax'

Create a variable called min_weight and set it to 5

Create a list called edges that includes tuples of (start_node, end_node, weight) for edges with weight greater than or equal to min_weight

Create a LangChain Graph object called city_graph using the nodes and edges

💡 Why This Matters

🌍 Real World

Graphs are used to model networks like social connections, maps, or recommendation systems.

💼 Career

Understanding graph structures is important for roles in data science, AI, and software engineering working with complex data relationships.

1

Create the nodes dictionary

Create a dictionary called nodes with these exact entries: 'Library': 'A place with books', 'Cafe': 'A place to drink coffee', 'Park': 'A place to relax'

LangChain

# Create the nodes dictionary with exact entries
# Your code here

Hint

Use curly braces {} to create a dictionary with the exact keys and values.

2

Set the minimum edge weight

Create a variable called min_weight and set it to 5

LangChain

nodes = {
    'Library': 'A place with books',
    'Cafe': 'A place to drink coffee',
    'Park': 'A place to relax'
}
# Create a variable min_weight and set it to 5
# Your code here

Hint

Just assign the number 5 to the variable min_weight.

3

Create edges with weight filter

Create a list called edges that includes tuples of (start_node, end_node, weight) for these connections: ('Library', 'Cafe', 7), ('Cafe', 'Park', 3), ('Library', 'Park', 5). Include only edges with weight greater than or equal to min_weight.

LangChain

nodes = {
    'Library': 'A place with books',
    'Cafe': 'A place to drink coffee',
    'Park': 'A place to relax'
}

min_weight = 5
# Create edges list with tuples (start_node, end_node, weight) where weight >= min_weight
# Your code here

Hint

Use a list comprehension to filter edges by weight.

4

Create the LangChain Graph object

Create a LangChain Graph object called city_graph using the nodes and edges variables.

LangChain

nodes = {
    'Library': 'A place with books',
    'Cafe': 'A place to drink coffee',
    'Park': 'A place to relax'
}

min_weight = 5

all_edges = [
    ('Library', 'Cafe', 7),
    ('Cafe', 'Park', 3),
    ('Library', 'Park', 5)
]

edges = [edge for edge in all_edges if edge[2] >= min_weight]

# Import Graph from langchain.graphs and create city_graph with nodes and edges
# Your code here

Hint

Import Graph from langchain.graphs and create city_graph with the nodes and edges.

Practice

1. What is the main role of a node in a graph structure in Langchain?

easy

A. To hold data and references to connected edges

B. To perform calculations on data

C. To store the entire graph structure

D. To act as a user interface element

Solution

1. Step 1: Understand the definition of a node

   A node in a graph holds data and keeps track of edges connecting it to other nodes.

2. Step 2: Compare options with node role

   Only To hold data and references to connected edges correctly describes this role; others describe unrelated functions.

3. Final Answer:

   To hold data and references to connected edges -> Option A

4. Quick Check:

   Node = data + edges [OK]

Hint: Nodes store data and edges, not whole graph or UI [OK]

Common Mistakes:

• Confusing nodes with edges
• Thinking nodes store entire graph
• Assuming nodes perform calculations

2. Which of the following is the correct way to create a directed edge from node A to node B in Langchain?

easy

A. edge = Edge(node_b, node_a, directed=True)

B. edge = Edge(node_a, node_b, directed=False)

C. edge = Edge(node_a, node_b, directed=True)

D. edge = Edge(node_a, node_b)

Solution

1. Step 1: Identify directed edge syntax

   Directed edges require specifying the direction from source to target with directed=True.

2. Step 2: Match option with correct direction

   edge = Edge(node_a, node_b, directed=True) correctly creates an edge from node_a to node_b with directed=True.

3. Final Answer:

   edge = Edge(node_a, node_b, directed=True) -> Option C

4. Quick Check:

   Directed edge = Edge(source, target, directed=True) [OK]

Hint: Directed edges need directed=True and correct node order [OK]

Common Mistakes:

• Swapping source and target nodes
• Omitting directed=True for directed edges
• Using directed=False for directed edges

3. Given the following code snippet in Langchain:

node1 = Node('A')
node2 = Node('B')
edge = Edge(node1, node2, directed=True)
node1.add_edge(edge)
print(len(node1.edges))

What will be the output?

medium

A. 0

B. 1

C. 2

D. Error

Solution

1. Step 1: Analyze edge addition to node1

   node1 adds one directed edge to node2, so node1.edges contains one edge.

2. Step 2: Count edges in node1

   len(node1.edges) returns 1 because only one edge was added.

3. Final Answer:

   1 -> Option B

4. Quick Check:

   Edges count = 1 [OK]

Hint: Count edges added to node, not total nodes [OK]

Common Mistakes:

• Assuming edges count is zero before adding
• Confusing nodes count with edges count
• Expecting error due to missing edge in node2

4. Consider this Langchain code snippet:

node1 = Node('X')
node2 = Node('Y')
edge = Edge(node1, node2)
node2.add_edge(edge)
print(len(node1.edges))

What is the problem with this code?

medium

A. print statement syntax is invalid

B. Edge creation syntax is incorrect

C. Nodes must be connected bidirectionally

D. Edge is added to the wrong node, so node1.edges is empty

Solution

1. Step 1: Check where edge is added

   The edge connects node1 to node2 but is added to node2.edges, not node1.edges.

2. Step 2: Understand effect on node1.edges

   Since node1.edges is not updated, its length remains zero, causing unexpected behavior.

3. Final Answer:

   Edge is added to the wrong node, so node1.edges is empty -> Option D

4. Quick Check:

   Edge must be added to source node [OK]

Hint: Add edges to source node to track connections correctly [OK]

Common Mistakes:

• Adding edge to target node instead of source
• Assuming edges auto-update both nodes
• Misreading print statement as error

5. You want to create a graph in Langchain where each node connects to multiple others with edges that can be either one-way or two-way. Which approach correctly models this?

hard

A. Create nodes with lists of edges; for two-way edges, add edges in both directions

B. Create nodes with a single edge object that stores all connections

C. Use only undirected edges to simplify connections

D. Store all edges globally without linking to nodes

Solution

1. Step 1: Understand node-edge relationship

   Nodes hold lists of edges to represent multiple connections.

2. Step 2: Model two-way edges

   Two-way edges require adding edges in both directions between nodes.

3. Step 3: Evaluate options

   Create nodes with lists of edges; for two-way edges, add edges in both directions correctly models nodes with multiple edges and two-way connections by adding edges both ways.

4. Final Answer:

   Create nodes with lists of edges; for two-way edges, add edges in both directions -> Option A

5. Quick Check:

   Two-way edges = edges both ways [OK]

Hint: Two-way edges need two directed edges, one each way [OK]

Common Mistakes:

• Using single edge object for all connections
• Assuming undirected edges cover all cases
• Not linking edges to nodes