Les Miserables
Co-appearance network of characters in Victor Hugo's novel Les Miserables. Edges connect characters that appear in the same chapter.
npx keepset fetch lesmiserables
- Nodes
- 77
- Edges
- 254
- Size
- 2.5 KiB
Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.
Overview
Sources and provenance
Citations
- D. E. Knuth (1993). The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley.
Recipe
| Source | #0 |
|---|
| Archive | zip |
|---|
| Member | lesmis.gml |
|---|
| Parser format | "gml" |
|---|
| Parser encoding | "utf-8" |
|---|
Crosswalk
keepset/topology to graph/v1, as a crossmap crosswalk.
| Rule | From | To | Direction |
|---|
| move | meta | meta | both |
| move | nodes[].id | nodes[].id | both |
| move | edges[].source | edges[].source | both |
| move | edges[].target | edges[].target | both |
Expected counts
Properties
| Components | 1 |
|---|
| Connected | yes |
|---|
| Cyclic | yes |
|---|
| Density | 0.08681 |
|---|
| Directed | no |
|---|
| Download bytes | 2.5 KiB |
|---|
| Edge types | 1 |
|---|
| Heterogeneous | no |
|---|
| Multigraph | no |
|---|
| Node types | 1 |
|---|
| Raw bytes | 21.2 KiB |
|---|
| Self loops | no |
|---|
| Weighted | no |
|---|