feat(Combinatorics/GraphLike): GraphLike with no multi edges

[Jun2M]

This PR introduces NoMultiEdgeGraphLike (alternative name suggestion are welcome), extension of GraphLike for those with no multiple darts, and therefore edges, between a pair of vertices.

---

• depends on: feat(Combinatorics/GraphLike): introduce GraphLike typeclass #36743

[github-actions]

PR summary 9d559c794f

Import changes for modified files

No significant changes to the import graph

Import changes for all files

Files	Import difference
Mathlib.Combinatorics.GraphLike.Basic (new file)	489

---

Declarations diff

+ Adj.left_mem
+ Adj.right_mem
+ DartAdj
+ GraphLike
+ NoMultiEdgeGraphLike
+ adj_source_target
+ dart_eq_of_source_target_eq
+ darts_ext
+ instance [DecidableRel (Adj G)] : DecidablePred (· ∈ D(G))
+ mem_darts_iff_adj
+ source_target_inj
+ toProd

You can run this locally as follows

## from your `mathlib4` directory:
git clone https://github.com/leanprover-community/mathlib-ci.git ../mathlib-ci

## summary with just the declaration names:
../mathlib-ci/scripts/pr_summary/declarations_diff.sh <optional_commit>

## more verbose report:
../mathlib-ci/scripts/pr_summary/declarations_diff.sh long <optional_commit>

The doc-module for scripts/pr_summary/declarations_diff.sh in the mathlib-ci repository contains some details about this script.

---

No changes to strong technical debt.

No changes to weak technical debt.

[mathlib-dependent-issues]

This PR/issue depends on:

• feat(Combinatorics/GraphLike): introduce GraphLike typeclass #36743
  By Dependent Issues (🤖). Happy coding!