# Graph and persistent graph

Up to now, we have made an implicit assumption that a temporal graph is made up of events (messages, citations, transactions) instantiated from one node to another that can be thought of as instantaneous. In the temporal graph literature, such representations of graphs are known as *link streams*. This representation can also capture temporal graphs that can be considered a sequence of static network snapshots (by giving edges integer timestamps 1, 2, 3, ... depending on the snapshot(s) in which they are found.)

However, there is another family of temporal graphs which don't fit into this format. What about instead of an instantaneous event, edges could be present for a defined amount of time? Such occasions might include proximity networks where an edge between two individuals is continuously present whenever they are close together, or a 'following' network where edges are established and later potentially removed. To enable these types of interactions to be represented, we provide an additional graph representation where edges can be added, removed and added back again called the `PersistentGraph`

. Let's have a look at how we create and manipulate such a graph.

```
from raphtory import PersistentGraph
G = PersistentGraph()
# new friendship
G.add_edge(1, "Alice", "Bob")
# additional friend
G.add_edge(3, "Bob", "Charlie")
# a dispute
G.delete_edge(5, "Alice", "Bob")
# a resolution
G.add_edge(10, "Alice", "Bob")
print(f"G's edges are {G.edges}")
print(f"G's exploded edges are {G.edges.explode()}")
```

Output

```
G's edges are Edges(Edge(source=Alice, target=Bob, earliest_time=1, latest_time=9223372036854775807), Edge(source=Bob, target=Charlie, earliest_time=3, latest_time=9223372036854775807))
G's exploded edges are Edges(Edge(source=Alice, target=Bob, earliest_time=1, latest_time=5), Edge(source=Alice, target=Bob, earliest_time=10, latest_time=9223372036854775807), Edge(source=Bob, target=Charlie, earliest_time=3, latest_time=9223372036854775807))
```

Here we have a graph with two edges: one connecting Alice and Bob, and one connecting Bob and Charlie, and three *exploded edges*, one for each activation of Alice and Bob's edge and the activation of Bob and Charlie's edge. Note that if an edge is not explicitly deleted, it is assumed to last forever (or at least until int max value...)

Over the next few pages, we will explore how the persistent graph works to understand its behaviour/semantics and how it can unlock some interesting analysis.