Jump to content

Search the Community

Showing results for tags 'arbore'.

  • Search By Tags

    Type tags separated by commas.

  • Search By Author

Content Type


Forums

  • Informatii generale
    • Anunturi importante
    • Bine ai venit
    • Proiecte RST
  • Sectiunea tehnica
    • Exploituri
    • Challenges (CTF)
    • Bug Bounty
    • Programare
    • Securitate web
    • Reverse engineering & exploit development
    • Mobile security
    • Sisteme de operare si discutii hardware
    • Electronica
    • Wireless Pentesting
    • Black SEO & monetizare
  • Tutoriale
    • Tutoriale in romana
    • Tutoriale in engleza
    • Tutoriale video
  • Programe
    • Programe hacking
    • Programe securitate
    • Programe utile
    • Free stuff
  • Discutii generale
    • RST Market
    • Off-topic
    • Discutii incepatori
    • Stiri securitate
    • Linkuri
    • Cosul de gunoi
  • Club Test's Topics
  • Clubul saraciei absolute's Topics
  • Chernobyl Hackers's Topics
  • Programming & Fun's Jokes / Funny pictures (programming related!)
  • Programming & Fun's Programming
  • Programming & Fun's Programming challenges
  • Bani pă net's Topics
  • Cumparaturi online's Topics
  • Web Development's Forum
  • 3D Print's Topics

Find results in...

Find results that contain...


Date Created

  • Start

    End

Last Updated

  • Start

    End

Filter by number of...

Joined

  • Start

    End

Group

Website URL

Yahoo

Jabber

Skype

Location

Interests

Occupation

Interests

Biography

Location

Found 1 result

  1. Eusebiu1
    Se da graful orientat: ij : 01 02 03 12 23 15 16 25 26 34 35 45 47 57 58 68 78 cost(ij) 3 4 5 7 6 6 5 2 2 1 6 7 2 1 8 4 5 Determinati un arbore partial al acestiu graf care sa fie de cost minim. Eu stiam ca arborii partiali sunt doar pe grafuri neorientate de unde si algoritmii(Prim , Kruskal) dar profu se pare ca e de alta parere. Poate sa imi explice si mie cineva cum se rezolva asta ? Gresesc eu sau profesorul.
×
×
  • Create New...