Description
Deduplicate both supplied neighbor lists and return their literal intersection in first-list order and its count.
Local graph quantities describe a vertex, an edge, or a small neighborhood. Their algebra often assumes a simple undirected graph; using the same expression for loops, multigraphs, or directed data can change its meaning.
Deduplicate both supplied neighbor lists and return their literal intersection in first-list order and its count.
When to use this tool
Use Bipartite Projection Shared Neighbor Pair when you need a local graph quantity from explicitly supplied neighborhoods or counts.
How to use the tool and how it works
- Enter first, second. Keep parallel arrays aligned. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read shared, count. Use the output convention below.
Deduplicate both supplied neighbor lists and return their literal intersection in first-list order and its count.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| first | First | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| second | Second | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| shared | Shared | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| count | Count under the documented selection and duplicate convention. | Required. Safe integer. |
{
"input": {
"first": [
"x",
"y",
"y"
],
"second": [
"y",
"z"
]
},
"output": {
"shared": [
"y"
],
"count": 1
}
}Limitations and assumptions
- This is one projected pair's shared-neighbor set; bipartite partitions, actual edges, vertex identity, and a full projected graph are not verified.
- Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
Alternative or Complementary methods
Inspect the actual graph or run a full traversal when the claim depends on global structure. Match the algorithm's graph model to direction, loops, multiplicity, and connectivity requirements.
References
Similar or alternative tools
- Graph: Bipartite Edge Partition Pair Check
Return crossesPartitions for opposite-side endpoints and endpointsKnown independently, inside result.
- Bfs Layer Edge Level Gap
For directed edges allow any gap at most one; for undirected edges require absolute gap at most one.