Description
Intersect distinct firstNeighbors with secondNeighbors while excluding the two endpoint IDs, and return common neighbors and their 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.
Intersect distinct firstNeighbors with secondNeighbors while excluding the two endpoint IDs, and return common neighbors and their count.
When to use this tool
Use Triangle Edge Support Count when you need a local graph quantity from explicitly supplied neighborhoods or counts.
How to use the tool and how it works
- Enter firstVertex, secondVertex, firstNeighbors, secondNeighbors. 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 supportCount, commonNeighbors. Use the output convention below.
Require distinct endpoint vertices. Intersect distinct firstNeighbors with secondNeighbors while excluding the two endpoint IDs, and return common neighbors and their count.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| firstVertex | First Vertex | Required. Text; maximum UTF-16 length 8192. |
| secondVertex | Second Vertex | Required. Text; maximum UTF-16 length 8192. |
| firstNeighbors | First Neighbors | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| secondNeighbors | Second Neighbors | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| supportCount | Support Count | Required. Safe integer. |
| commonNeighbors | Common Neighbors | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
{
"input": {
"firstVertex": "A",
"secondVertex": "B",
"firstNeighbors": [
"B",
"C",
"D"
],
"secondNeighbors": [
"A",
"C",
"E"
]
},
"output": {
"supportCount": 1,
"commonNeighbors": [
"C"
]
}
}Limitations and assumptions
- The tool does not verify that the endpoint edge exists or that lists are actual graph neighbors; the count alone is not a complete triangle census or topology validation.
- 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
- Bipartite Projection Shared Neighbor Pair
Deduplicate both supplied neighbor lists and return their literal intersection in first-list order and its count.
- Graph: Bipartite Edge Partition Pair Check
Return crossesPartitions for opposite-side endpoints and endpointsKnown independently, inside result.