Qurak
Dokumentasi
Harga
Masuk
Qurak
Dokumentasi
Fungsi
FindGraphIsomorphism
FindGraphIsomorphism
Tersedia
Finds vertex mapping between isomorphic graphs
Bentuk
FindGraphIsomorphism[g1, g2]
FindGraphIsomorphism[g1, g2, n]
FindGraphIsomorphism[{v -> w, …}, …]
Contoh terverifikasi
FindGraphIsomorphism[CycleGraph[3], CycleGraph[4]] → {}
map = (Normal /@ FindGraphIsomorphism[g, h])[[1]] → g
Jalankan ini di Qurak
Cari di referensi
Topik
Discrete Mathematics
- Graphs and Networks »
Graph Predicates
- Global Structural Properties
Graph Properties And Measurements
- Graph Isomorphism
New In100 Graphs And Networks
- Isomorphisms
New In80 Alphabetical Listing
- F
Terkait
IsomorphicGraphQ
CanonicalGraph
GraphAutomorphismGroup
FindIsomorphicSubgraph
FindSubgraphIsomorphism
IsomorphicSubgraphQ
VertexReplace
FindShortestPath
AcyclicGraphQ
BipartiteGraphQ
ConnectedGraphQ
EulerianGraphQ
← FindGraphCommunities
FindGraphPartition →
Semua 6300 fungsi
·
Pakai ini dari klien MCP